Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications
From MaRDI portal
Publication:5108241
DOI10.1287/moor.2018.0967zbMath1434.90101arXiv1711.07028OpenAlexW2965277799MaRDI QIDQ5108241
Christopher Thomas Ryan, Guanyi Wang, Amitabh Basu, R. Kipp Martin
Publication date: 30 April 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.07028
Mixed integer programming (90C11) Boolean programming (90C09) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some properties of convex hulls of integer points contained in general convex sets
- Projecting systems of linear inequalities with binary variables
- The b-hull of an integer program
- Decomposing finitely generated integral monoids by elimination
- Fourier-Motzkin elimination extension to integer programming problems
- Integer programming as projection
- Mixed-integer linear representability, disjunctions, and variable elimination
- Mixed-integer convex representability
- Mixed Integer Linear Programming Formulation Techniques
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- On the Mixed Binary Representability of Ellipsoidal Regions
- Integer Programming
- Modelling with integer variables
- Fourier's Method of Linear Programming and Its Dual
- Integer programming duality: Price functions and sensitivity analysis
- The value function of an integer program
- The Elimination of Integer Variables
This page was built for publication: Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications