EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1845. The origin of the Branch-and-Bound Method
Invited abstract in session WB-20: Moments in the history of OR 1, stream Moments in the history of OR.
Wednesday, 10:30-12:00Room: 45 (building: 116)
Authors (first author is the speaker)
| 1. | Janny LEUNG
|
| State Key Lav of Internet of Things for Smart City, The University of Macau |
Abstract
In 1960, under the simple title “An automatic method of solving discrete programming problem”, the method for solving mixed-integer-programming problems was introduced. This Branch-and-Bound framework, with enhancements, remains at the core of discrete optimization software to this day, more than 60 years later. We will discuss the many pioneering ideas of this paper, and also the two women pioneers of operational research, Ailsa Land and Alison Doig Harcourt, who co-authored this landmark paper.
Keywords
- OR History
- Programming, Mixed-Integer
Status: accepted
Back to the list of papers