Publisher
Springer Berlin Heidelberg
Reference44 articles.
1. Balinski, M.L. and K. Spielberg [ 1969 ] “Methods for integer programming: Algebraic, combinatorial and enumerative”, in Aronofsky (ed) Progress in Operations Research, Wiley, New York, 195–192.
2. Beale, E.M.L. [ 1965 ] “Survey of integer programming”, Operational Research Quarterly 16 219–228.
3. Benichou, M., J.M. Gauthier, P. Girodet, G. Heutges, G. Ribière and O. Vincent [ 1971 ] “Experiments in mixed-integer linear programming”, Mathematical Programming 1 76–94.
4. Crowder, H., E.L. Johnson and M. Padberg [ 1983 ] “Solving large-scale zero-one linear programming problems”, Operations Research 31 803–834.
5. Dakin, R.J. [ 1965 ] “A tree-search algorithm for mixed-integer programming”, Computer J. 8 250–255.