© 1965 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||
A tree-search algorithm for mixed integer programming problems
Basser Computing Department, School of Physics, University of Sydney, N.S.W., Australia
This paper describes a new algorithm for finding solutions to optimization problems in which some of the variables must take integral values. The algorithm appears to offer some advantages over a similar algorithm proposed by Land and Doig, from which it was developed.
The paper describes computational procedures which result in modest storage requirements. The method has been programmed and used to solve several problems.
* Basser Computing Department, School of Physics, University of Sydney, N.S.W., Australia.
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
A. Ariel, B. P. Veldkamp, and K. Breithaupt Optimal Testlet Pool Assembly for Multistage Testing Designs Applied Psychological Measurement, May 1, 2006; 30(3): 204 - 215. [Abstract] [PDF] |
||||
![]() |
J. J. Adema and W. J. van der Linden Algorithms for Computerized Test Construction Using Classical Item Parameters Journal of Educational and Behavioral Statistics, January 1, 1989; 14(3): 279 - 290. [Abstract] [PDF] |
||||

