Improved penalty calculations for a mixed integer branch-and-bound algorithm
- 1 December 1974
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 6 (1) , 212-223
- https://doi.org/10.1007/bf01580237
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Use of Cyclic Group Methods in Branch and BoundPublished by Elsevier ,1973
- Lagrangean Relaxation and Its Uses in Integer ProgrammingPublished by Defense Technical Information Center (DTIC) ,1972
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- Experiments in mixed-integer linear programmingMathematical Programming, 1971
- A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming ProblemsOperations Research, 1971
- Generalized upper bounding techniquesJournal of Computer and System Sciences, 1967
- Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D ProjectsManagement Science, 1967
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)Operations Research, 1964
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962