Abstract
In 1960, Ailsa Land and Alison Doig published the first linear programming-based branchand-bound algorithm for the solution of mixed integer linear programs. This algorithm has had a major impact on the field of mathematical programming and remains to this day the only available solution methodology for generic mixed integer linear programs. This article recounts the genesis of this algorithm and describes some of the developments that have taken place since its publication.
| Original language | English |
|---|---|
| Pages (from-to) | 463-471 |
| Number of pages | 9 |
| Journal | Australian & New Zealand Journal Of Statistics |
| Volume | 67 |
| Issue number | 4 |
| Early online date | 5 Mar 2025 |
| DOIs | |
| Publication status | Published - 31 Dec 2025 |
Bibliographical note
Publisher Copyright:© 2025 Statistical Society of Australia.
Acknowledgements
Thanks are due to Jean-Marie Bourjolly for his comments on an earlier version of this paper, to Alysson M. Costa, Frank Land and Louis Ta who provided some useful references and to the referees for their valuable comments. Opinions and attitudes expressed in this document, which are not explicitly designated as Journal policy, are those of the author and are not necessarily endorsed by the Journal, its editorial board, its publisher Wiley or by the Australian Statistical Publishing Association Inc.Keywords
- Gomory cutting planes
- branch-and-bound
- branch-and-cut
- mixed integer linear programming
- simplex algorithm
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
Fingerprint
Dive into the research topics of 'A seminal contribution of Ailsa Land and Alison Doig Harcourt to the field of mathematical programming'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS