Embedding formulations and complexity for unions of polyhedra
Year of publication: |
October 2018
|
---|---|
Authors: | Vielma, Juan Pablo |
Published in: |
Management science : journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : INFORMS, ISSN 0025-1909, ZDB-ID 206345-1. - Vol. 64.2018, 10, p. 4721-4734
|
Subject: | integer programming | mixed-integer programming | mixed-integer modeling | strong formulation | piecewise linear | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
A combinatorial approach for small and strong formulations of disjunctive constraints
Huchette, Joey, (2019)
-
A column generation approach for aircraft sequencing problems : a computational study
Ghoniem, Ahmed, (2015)
-
Mathematical models and algorithms for a high school timetabling problem
Al-Yakoob, Salem M., (2015)
- More ...
-
A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
Vielma, Juan Pablo, (2008)
-
A note on "a superior representation method for piecewise linear functions"
Vielma, Juan Pablo, (2010)
-
The Chvátal-Gomory closure of a strictly convex body
Dadush, Daniel, (2011)
- More ...