@Article{land60a,
  author =	 {A. H. Land and A. G Doig},
  title =	 {An Automatic Method of Solving Discrete Programming
                  Problems},
  journal =	 {Econometrica},
  year =	 1960,
  volume =	 28,
  number =	 3,
  pages = 	 {497--520},
  abstract =	 {In the classical linear programming problem the
                  behaviour of continuous, nonnegative variables
                  subject to a system of linear inequalities is
                  investigated. One possible generalization of this
                  problem is to relax the continuity condition the
                  variables. This paper presents a simple numerical
                  algorithm for the solution of programming problems
                  in which some or all of the variables can take only
                  discrete values. The algorithm requires no special
                  techniques beyond these used in ordinary linear
                  programming, and lends itself to automatic
                  computing. Its use is illustrated on two numerical
                  examples.},
  url = 	 {http://jmvidal.cse.sc.edu/library/land60a.pdf},
  cluster = 	 16881498411250612476,
  comment = 	 {Original branch and bound algorithm.},
}