Solving real-world linear programs

Bixby, R. E. (2002). Solving real-world linear programs: A decade and more of progress. Operations Research, 50(1), 3-15.

Type

Journal article

Intellectual base

Primary research

Year

2002

DOI

10.1287/opre.50.1.3.17780

Link

https://doi.org/10.1287/opre.50.1.3.17780

Cited from

operations_research

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Branch and Bound
  • The Concorde campaign's broader significance: it demonstrated that problems once considered intractable could become routine through sustained algorithmic and implementation improvement; it produced a publicly-available high-quality solver (documented extensively in Bixby's (2002)

    This sourcedocuments the compounding LP/MIP solver performance gains from the 1990s (presolve, cuts, heuristics, branch-and-bound) — evidence for the compounding-improvements story.

• Integer Linear Programming (ILP)
  • The tooling ecosystem includes: commercial solvers (CPLEX, Gurobi, FICO Xpress as the leading-performance options; Mosek and others for specialized contexts) with sophisticated presolve, cut generation, parallel search, and heuristics — Bixby (2002) chronicles the decade-plus of algorithmic and implementation progress that produced the modern solver landscape.

    This sourceDocuments the dramatic LP/MIP solver performance gains from the 1990s, attributing them to integrated improvements in LP solvers, presolve, cutting planes, heuristics, and branch-and-bound search; widely cited as evidence for the compounding-improvements story.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:faf33bfbdb26 · see in the full table