Branch and Bound Methods for Mathematical Programming Systems
- 1 January 1979
- book chapter
- Published by Elsevier in Annals of Discrete Mathematics
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational resultsMathematical Programming, 1977
- Global optimization using special ordered setsMathematical Programming, 1976
- Analysis of mathematical programming problems prior to applying the simplex algorithmMathematical Programming, 1975
- Practical Solution of Large Mixed Integer Programming Problems with UmpireManagement Science, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Branch and bound experiments in zero-one programmingPublished by Springer Nature ,1974
- Experiments in mixed-integer linear programmingMathematical Programming, 1971
- An Algorithm for the Solution of Mixed Integer Programming ProblemsManagement Science, 1966
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958