Mixed-integer cuts from cyclic groups
From MaRDI portal
Publication:868450
DOI10.1007/s10107-006-0726-4zbMath1278.90274OpenAlexW2019638546MaRDI QIDQ868450
Cristiano Saturni, Matteo Fischetti
Publication date: 5 March 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0726-4
Related Items
Two row mixed-integer cuts via lifting, Computational Experiments with Cross and Crooked Cross Cuts, Continuous cutting plane algorithms in integer programming, A heuristic to generate rank-1 GMI cuts, On the Practical Strength of Two-Row Tableau Cuts, On a generalization of the master cyclic group polyhedron, On the strength of Gomory mixed-integer cuts as group cuts, How tight is the corner relaxation?, Relations between facets of low- and high-dimensional group problems
Uses Software
Cites Work
- Unnamed Item
- How tight is the corner relaxation?
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Cyclic group and knapsack facets
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- Extended formulations for Gomory corner polyhedra
- Valid inequalities based on the interpolation procedure
- Some polyhedra related to combinatorial problems
- Gomory cuts revisited
- Valid inequalities based on simple mixed-integer sets
- K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
- Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
- Outline of an algorithm for integer solutions to linear programs
- Integer Programming and Pricing
- Optimizing over the First Chvàtal Closure
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
