Improving the LP bound of a MILP by branching concurrently
| dc.creator | Buesching, H. Georg | |
| dc.date | 2007-11-02 | |
| dc.date | 2008-11-21 | |
| dc.date.accessioned | 2026-07-07T10:19:35Z | |
| dc.date.available | 2026-07-07T10:19:35Z | |
| dc.description | We'll measure the differences of the dual variables and the gain of the objective function when creating new problems, which each has one inequality more than the starting LP-instance. These differences of the dual variables are naturally connected to the branches. Then we'll choose those differences of dual variables, so that for all combinations of choices at the connected branches, all dual inequalities will hold for sure. By adding the gain of each chosen branching, we get a total gain, which gives a better limit of the original problem. By this technique it is also possible to create cuts. | |
| dc.description | 21 pages of a possibly new theory submitted by a hobby researcher. Uses algorithmic.sty | |
| dc.identifier | https://arxiv.org/abs/0711.0311 | |
| dc.identifier | http://arxiv.org/abs/0711.0311 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/174561 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Improving the LP bound of a MILP by branching concurrently | |
| dc.type | text |