Solving Real-World Linear Programs: A Decade and More of Progress

Authors:
Robert E. Bixby
Affiliations:
-
Venue:
Operations Research
Year:
2002

Citing 0
Cited 36

Book Review: Computational Techniques of the Simplex Method

Computational Optimization and Applications
A genetic algorithm for the project assignment problem

Computers and Operations Research
Optimal refinement of rule bases

AI Communications
Hyper-Sparsity in the Revised Simplex Method and How to Exploit it

Computational Optimization and Applications
COAP 2005 Best Paper Award

Computational Optimization and Applications
Optimal refinement of rule bases

AI Communications
Invitation to data reduction and problem kernelization

ACM SIGACT News
An interior-point approach for primal block-angular problems

Computational Optimization and Applications
Progress in the dual simplex method for large scale LP problems: practical dual phase 1 algorithms

Computational Optimization and Applications
Selected Topics in Column Generation

Operations Research
Linear Programming Relaxations and Belief Propagation -- An Empirical Study

The Journal of Machine Learning Research
A computational study of DEA with massive data sets

Computers and Operations Research
Review of "Computational Techniques of the Simplex Method by István Maros", Kluwer Academic Publishers, 2003

ACM SIGACT News
Scaling performance of interior-point method on large-scale chip multiprocessor system

Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Progress in the dual simplex algorithm for solving large scale LP problems: techniques for a fast and stable implementation

Computational Optimization and Applications
Planning production using mathematical programming: The case of a woodturning company

Computers and Operations Research
Implementing a parallel matrix factorization library on the cell broadband engine

Scientific Programming - High Performance Computing with the Cell Broadband Engine
Technology that upsets the social order: a paradigm shift in assigning lots to tools in a wafer fabricator -- the transition from rules to optimization

Proceedings of the 40th Conference on Winter Simulation
Backdoors to Combinatorial Optimization: Feasibility and Optimality

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Loosely coupled formulations for automated planning: an integer programming perspective

Journal of Artificial Intelligence Research
Local search: simple, successful, but sometimes sluggish

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
A GRASP with evolutionary path relinking for the truck and trailer routing problem

Computers and Operations Research
Exact optimization for the l1-Compressive Sensing problem using a modified Dantzig-Wolfe method

Theoretical Computer Science
Automatic structure detection in constraints of tabular data

PSD'06 Proceedings of the 2006 CENEX-SDC project international conference on Privacy in Statistical Databases
Efficient nested pricing in the simplex algorithm

Operations Research Letters
Recovering an optimal LP basis from an optimal dual solution

Operations Research Letters
George B. Dantzig and systems optimization

Discrete Optimization
Scaling linear optimization problems prior to application of the simplex method

Computational Optimization and Applications
On an exact method for the constrained shortest path problem

Computers and Operations Research
Efficient local search on the GPU-Investigations on the vehicle routing problem

Journal of Parallel and Distributed Computing
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network

INFORMS Journal on Computing
Risk-averse two-stage stochastic programs in furniture plants

OR Spectrum
A variable-reduction technique for the fixed-route vehicle-refueling problem

Computers and Industrial Engineering
Implementing the simplex method as a cutting-plane method, with a view to regularization

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is an invited contribution to the 50th anniversary issue of the journalOperations Research, published by the Institute of Operations Research and Management Science (INFORMS). It describes one person's perspective on the development of computational tools for linear programming. The paper begins with a short personal history, followed by historical remarks covering the some 40 years of linear-programming developments that predate my own involvement in this subject. It concludes with a more detailed look at the evolution of computational linear programming since 1987.