A combinatorial approach for small and strong formulations of disjunctive constraints
Year of publication: |
2019
|
---|---|
Authors: | Huchette, Joey ; Vielma, Juan Pablo |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 44.2019, 3, p. 793-820
|
Subject: | integer programming | piecewise linear | polyhedra | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | KMU | SME |
-
Embedding formulations and complexity for unions of polyhedra
Vielma, Juan Pablo, (2018)
-
"Facet" separation with one linear program
Conforti, Michele, (2016)
-
The circlet inequalities : a new, circulant-based, facet-defining inequality for the TSP
Gutekunst, Samuel C., (2023)
- More ...
-
A geometric way to build strong mixed-integer programming formulations
Huchette, Joey, (2019)
-
Nonconvex piecewise linear functions : advanced formulations and simple modeling tools
Huchette, Joey, (2023)
-
A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
Vielma, Juan Pablo, (2008)
- More ...