On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
DOI10.1137/S089548019325900XzbMATH Open0856.90081OpenAlexW2000397658MaRDI QIDQ4895628FDOQ4895628
Authors: 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
Recommendations
- A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball
- scientific article; zbMATH DE number 780782
- A long-step, cutting plane algorithm for linear and convex programming
- Solving combinatorial optimization problems using Karmarkar's algorithm
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
Linear programming (90C05) Combinatorial optimization (90C27) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11)
Cited In (13)
- A long-step, cutting plane algorithm for linear and convex programming
- Title not available (Why is that?)
- Combinatorial complexity of a certain 1-dimensional cutting stock problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Branch and cut methods for network optimization
- Solving combinatorial optimization problems using Karmarkar's algorithm
- On the redundancy of cutting planes for linear complementarity problems
- A parallel cutting plane algorithm for two-level linear programming problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball
Uses Software
This page was built for publication: On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895628)
