Can Pure Cutting Plane Algorithms Work?

DOI10.1007/978-3-540-68891-4_29zbMath1143.90398OpenAlexW2114330374MaRDI QIDQ3503863

Matteo Fischetti, Egon Balas, Arrigo Zanette

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

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

Related Items (3)

Cutting plane selection with analytic centers and multiregression ⋮ Lexicography and degeneracy: Can a pure cutting plane algorithm work? ⋮ A critical review of discrete filled function methods in solving nonlinear discrete optimization problems

Uses Software

• MIPLIB

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