Can Pure Cutting Plane Algorithms Work?

DOI10.1007/978-3-540-68891-4_29MaRDI QIDQ3503863zbMATH OpenOpenAlexFDO

Authors Arrigo Zanette, Matteo Fischetti, E. Balas

Publication date 10 June 2008

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68891-4_29

zbMATH Keywords

Computational AnalysisCutting Plane MethodsDegeneracy in Linear ProgrammingGomory CutsLexicographic Dual Simplex

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• On the enumerative nature of Gomory's dual cutting plane method
• Gomory cuts revisited
• Computing with Multi-row Gomory Cuts
• Primal cutting plane algorithms revisited

Cited in

(7)

• Primal cutting plane algorithms revisited
• Construction and selection for Gomory cutting plane
• Cutting plane selection with analytic centers and multiregression
• On the enumerative nature of Gomory's dual cutting plane method
• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
• A hard integer program made easy by lexicography

Describes a project that uses

Uses Software

• MIPLIB

This page was built for publication: Can Pure Cutting Plane Algorithms Work?

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