Shapes and recession cones in mixed-integer convex representability
Mixed-integer convex representable (MICP-R) sets are those sets that can be represented exactly through a mixed-integer convex programming formulation. Following up on recent work by Lubin et al. (in: Eisenbrand (ed) Integer Programming and Combinatorial Optimization - 19th International Conference,...
Main Authors: | Zadik, Ilias, Lubin, Miles, Vielma, Juan Pablo |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | English |
Published: |
Springer Science and Business Media LLC
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/1721.1/153535 |
Similar Items
-
Disjunctive cuts in Mixed-Integer Conic Optimization
by: Lodi, Andrea, et al.
Published: (2023) -
Functions with Positive Differences on Convex Cones
by: Niculescu, Constantin P., et al.
Published: (2023) -
MSG352 - Linear and Integer Programming
by: PPSM, Pusat Pengajian Sains Matematik
Published: (2022) -
On polynomial pairs of integers
by: Ezerman, Martianus Frederic, et al.
Published: (2015) -
An integer optimization framework for future air traffic flow management
by: Diao, Xudong
Published: (2016)