Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 50, No. 1, January-February 2002, pp. 3-15
DOI: 10.1287/opre.50.1.3.17780
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Bixby, R. E.
Right arrow Search for Related Content

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

Robert E. Bixby

ILOG, Inc. and Rice University
bixby{at}ilog.com
bixby{at}rice.edu

This paper is an invited contribution to the 50th anniversary issue of the journal Operations 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.

Subject classifications: Professional: comments on.



This article has been cited by other articles:


Home page
The Computer JournalHome page
F. Huffner, R. Niedermeier, and S. Wernicke
Techniques for Practical Fixed-Parameter Algorithms
The Computer Journal, January 1, 2008; 51(1): 7 - 25.
[Abstract] [Full Text] [PDF]


Home page
International Regional Science ReviewHome page
J. C. Duque, R. Ramos, and J. Surinach
Supervised Regionalization Methods: A Survey
International Regional Science Review, July 1, 2007; 30(3): 195 - 220.
[Abstract] [PDF]


Home page
INFORMS Journal on ComputingHome page
J. Castro
A Shortest-Paths Heuristic for Statistical Data Protection in Positive Tables
INFORMS Journal on Computing, January 1, 2007; 19(4): 520 - 533.
[Abstract] [PDF]


Home page
Operations ResearchHome page
M. E. Lubbecke and J. Desrosiers
Selected Topics in Column Generation
Operations Research, November 1, 2005; 53(6): 1007 - 1023.
[Abstract] [PDF]


Home page
Management ScienceHome page
T. Kuosmanen
Efficient Diversification According to Stochastic Dominance Criteria
Management Science, October 1, 2004; 50(10): 1390 - 1406.
[Abstract] [PDF]


Home page
Transportation ScienceHome page
M. Christiansen, K. Fagerholt, and D. Ronen
Ship Routing and Scheduling: Status and Perspectives
Transportation Science, February 1, 2004; 38(1): 1 - 18.
[Abstract] [PDF]


Home page
INFORMS Journal on ComputingHome page
R. D. McBride and J. W. Mamer
Implementing an LU Factorization for the Embedded Network Simplex Algorithm
INFORMS Journal on Computing, January 1, 2004; 16(2): 109 - 119.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2002 by INFORMS.