Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

DOI10.1145/321796.321808zbMath0279.68035OpenAlexW2078162318MaRDI QIDQ4766036

Walter Köhler, Kenneth Steiglitz

Publication date: 1974

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321796.321808

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Related Items (16)

A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions ⋮ Automatic generation of dominance breaking nogoods for a class of constraint optimization problems ⋮ Compact representation of near-optimal integer programming solutions ⋮ Dominance rules in combinatorial optimization problems ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Branch-and-bound as a higher-order function ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Search techniques for a nonlinear multiprocessor scheduling problem ⋮ Using branch-and-bound algorithms to obtain suboptimal solutions ⋮ Resource allocation algorithm for light communication grid-based workflows within an SLA context ⋮ Theoretical comparisons of search strategies in branch-and-bound algorithms ⋮ Depth-m search in branch-and-bound algorithms ⋮ An extremal problem on random trees ⋮ A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures ⋮ General branch and bound, and its relation to \(A^*\) and \(AO^*\) ⋮ Probability modeling of branch-and-bound method

This page was built for publication: Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems