Efficient MIP techniques for computing the relaxation complexity
From MaRDI portal
Publication:6095738
DOI10.1007/s12532-023-00241-9zbMath1519.90125arXiv2203.05224OpenAlexW4364378213MaRDI QIDQ6095738
Gennadiy Averkov, Matthias Schymura, Christopher Hojny
Publication date: 8 September 2023
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.05224
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Cites Work
- Unnamed Item
- Dimension of the Lisbon voting rules in the EU council: a challenge and new world record
- Lower bounds on the sizes of integer programs without additional variables
- On defining sets of vertices of the hypercube by linear inequalities
- The densest hemisphere problem
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
- Strong IP formulations need large coefficients
- Complexity of linear relaxations in integer programming
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- A note on resolving infeasibility in linear programs by constraint relaxation
- Polytopes associated with symmetry handling
- Accurately learning from few examples with a polyhedral classifier
- Polynomial size IP formulations of knapsack may require exponentially large coefficients
- Computational aspects of relaxation complexity: possibilities and limitations
- Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-Oriented Block Ciphers
- Mathematics and Politics
- Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting
- Extended formulations in combinatorial optimization
- Polyhedral separability through successive LP
- On the extension complexity of polytopes separating subsets of the Boolean cube
