Name
Abstract | ||
|---|---|---|
We analyze different ways of constructing binary extended formulations of polyhedral mixed-integer sets with bounded integer variables and compare their relative strength with respect to split cuts. We show that among all binary extended formulations where each bounded integer variable is represented by a distinct collection of binary variables, what we call “unimodular” extended formulations are the strongest. We also compare the strength of some binary extended formulations from the literature. Finally, we study the behavior of branch-and-bound on such extended formulations and show that branching on the new binary variables leads to significantly smaller enumeration trees in some cases. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s10107-018-1294-0 | Math. Program. |
Keywords | Field | DocType |
Mixed-integer programming,Binarization,Extended formulations,Cutting planes,Branch-and-bound,90C11,90C57 | Integer,Discrete mathematics,Branch and bound,Enumeration,Integer programming,Unimodular matrix,Relative strength,Mathematics,Binary number,Bounded function | Journal |
Volume | Issue | ISSN |
170 | 1 | 0025-5610 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanjeeb Dash | 1 | 448 | 32.93 |
| Oktay GüNlüK | 2 | 502 | 41.29 |
| Robert Hildebrand | 3 | 69 | 7.82 |