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

DOI10.1145/321796.321808MaRDI QIDQ4766036zbMATH OpenOpenAlexFDO

Authors Walter Köhler, Ken 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)

Cited in

(16)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4766036)