Solving real-world linear programs: A decade and more of progress

Operations Research

Volumn 50, Issue 1, 2002, Pages 3-15

  Bixby, Robert E ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; LINEAR PROGRAMMING; USER INTERFACES;

COMPUTATIONAL RESEARCH;

OPERATIONS RESEARCH;

EID: 0036239414     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.50.1.3.17780     Document Type: Article

References (28)

1. Commentary: Progress in linear programming
2. Analysis of mathematical programming problems prior to applying the simplex algorithm
3. An empirical evaluation of the KORBX algorithms for military airlift applications
4. A specialized interior-point algorithm for multicommodity network flows
5. Steepest-edge simplex algorithms for linear programming
6. The first linear-programming shoppe
7. Sparse partial pivoting in time proportional to arithmetic operations
8. Using the steepest-edge simplex algorithm to solve sparse linear programs
9. Solution of large-scale symmetric travelling salesman problems
10. Pivot selection methods of the devex LP code
11. Reinversion with the preassigned pivot procedure
12. Computational experience in solving linear programs
13. Aspects of large-scale in-core linear programming
14. A new polynomial-time algorithm for linear programming
15. The dual method of solving the linear programming problem
16. Interior point methods for linear programming: Computational state of the art
17. XMP: A structured library of subroutines for experimental mathematical programming
18. History of the development of LP solvers
19. Solution of systems of linear inequalities on a digital computer
20. Sparse matrix ordering methods for interior point linear programming
21. The cost of subsistence
22. Computing sparse LU factorizations for large-scale linear programming bases