Spherical cuts for integer programming problems

DOI10.1111/J.1475-3995.2008.00604.XMaRDI QIDQ3499437zbMATH OpenOpenAlexFDO

Authors Leo Liberti

Publication date 29 May 2008

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1475-3995.2008.00604.x

zbMATH Keywords

intersection cutscutting plane algorithmvalid cut

Mathematics Subject Classification ID

Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)

Recommendations

• Classical cuts for mixed-integer programming and branch-and-cut
• A note on characterizing canonical cuts using geometry
• Classical cuts for mixed-integer programming and branch-and-cut
• Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
• Cutting planes in integer and mixed integer programming

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Canonical Cuts on the Unit Hypercube
• Exploiting orbits in symmetric ILP
• Integer programming and convex analysis: Intersection cuts from outer polars
• Outline of an algorithm for integer solutions to linear programs
• Packing and partitioning orbitopes
• Projection, lifting and extended formulation integer and combinatorial optimization
• Pruning by isomorphism in branch-and-cut
• Strengthening Chvátal-Gomory cuts and Gomory fractional cuts

Cited in

(5)

• Submodular maximization and its generalization through an intersection cut lens
• A note on characterizing canonical cuts using geometry
• On interval-subgradient and no-good cuts
• The cubic spherical optimization problems
• Generating cuts in integer programming with families of special ordered sets

This page was built for publication: Spherical cuts for integer programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499437)