Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
- 1 January 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 21 (1) , 140-156
- https://doi.org/10.1145/321796.321808
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Expression of Algorithms by ChartsJournal of the ACM, 1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Ein Branch-and-Bound-Verfahren-GeneratorComputing, 1971
- Tree-search algorithms for quadratic assignment problemsNaval Research Logistics Quarterly, 1971
- Branch-and-Bound Methods: General Formulation and PropertiesOperations Research, 1970
- Branch-and-Bound Methods: A SurveyOperations Research, 1966