Some new perspectives for solving 0–1 integer programming problems using Balas method
- 11 March 2021
- journal article
- research article
- Published by Springer Nature in Computational Management Science
- Vol. 18 (2) , 177-193
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Operations Research: Deterministic Optimization Models.Journal of the Operational Research Society, 1995
- Integer and Combinatorial OptimizationJournal of the Operational Research Society, 1990
- Generalized best-first search strategies and the optimality of A*Journal of the ACM, 1985
- Theoretical comparisons of search strategies in branch-and-bound algorithmsInternational Journal of Parallel Programming, 1976
- Technical Note—A Flexible Tree-Search Method for Integer Programming ProblemsOperations Research, 1971
- Integer Programming by Implicit Enumeration and Balas’ MethodSIAM Review, 1967
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming ProblemOperations Research, 1965
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960