Can Pure Cutting Plane Algorithms Work?
From MaRDI portal
Publication:3503863
DOI10.1007/978-3-540-68891-4_29zbMath1143.90398MaRDI 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
Computational Analysis; Cutting Plane Methods; Degeneracy in Linear Programming; Gomory Cuts; Lexicographic Dual Simplex
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C05: Linear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
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