On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs

DOI10.1137/S089548019325900XzbMath0856.90081OpenAlexW2000397658MaRDI QIDQ4895628

E. Andrew Boyd

Publication date: 14 October 1996

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s089548019325900x

zbMATH Keywords

separation oraclecutting plane algorithmcombinatorial linear programs

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (2)

A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball ⋮ Branch and cut methods for network optimization

Uses Software

• MINTO

This page was built for publication: On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs