Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
From MaRDI portal
Publication:1646575
DOI10.1007/s10107-017-1147-2zbMath1410.90127arXiv1508.02940OpenAlexW2199025894MaRDI QIDQ1646575
Rico Zenklusen, Robert Hildebrand, Jörg Bader, Robert Weismantel
Publication date: 25 June 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.02940
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Knapsack polytopes: a survey, The Integrality Number of an Integer Program, Lattice closures of polyhedra, Efficient MIP techniques for computing the relaxation complexity, Computational aspects of relaxation complexity: possibilities and limitations, Strong IP formulations need large coefficients, Balas formulation for the union of polytopes is optimal, On the regularity of orientable matroids, Compact mixed-integer programming formulations in quadratic optimization, The integrality number of an integer program
Cites Work
- Unnamed Item
- Unnamed Item
- On linear systems with integral valued solutions
- The chromatic index of nearly bipartite multigraphs
- A decomposition theory for matroids. V: Testing of matrix total unimodularity
- Total unimodularity and the Euler-subgraph problem
- Decomposition of regular matroids
- On the equal-subset-sum problem
- On defining sets of vertices of the hypercube by linear inequalities
- Disjunctive programming: Properties of the convex hull of feasible points
- Balanced matrices
- Network design with a discrete set of traffic matrices
- Integer Programming with a Fixed Number of Variables
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
- An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
- Constructing Extended Formulations from Reflection Relations
- NORMAL CYCLIC POLYTOPES AND CYCLIC POLYTOPES THAT ARE NOT VERY AMPLE
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
- Combinatorial optimization. Theory and algorithms
