Extended formulations for Gomory corner polyhedra
From MaRDI portal
Publication:2386199
DOI10.1016/j.disopt.2004.06.001zbMath1087.90050OpenAlexW2082037164MaRDI QIDQ2386199
Laurence A. Wolsey, Quentin Louveaux, Matthias Köppe, Robert Weismantel
Publication date: 22 August 2005
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2004.06.001
Related Items
Mixed-integer cuts from cyclic groups ⋮ Computing Optimized Path Integrals for Knapsack Feasibility ⋮ How tight is the corner relaxation? ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Non-standard approaches to integer programming
- A number theoretic reformulation and decomposition method for integer programming
- A primal all-integer algorithm based on irreducible solutions
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Cyclic group and knapsack facets
- Some polyhedra related to combinatorial problems
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Computational experience with a group theoretic integer programming algorithm