Using branch-and-bound algorithms to obtain suboptimal solutions

DOI10.1007/BF01916914zbMath0527.65043OpenAlexW1995576106MaRDI QIDQ3042297

No author found.

Publication date: 1983

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01916914

zbMATH Keywords

combinatorial optimization problemsbranch-and-bound algorithmssuboptimal solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (4)

Randomized algorithms in combinatorial optimization: A survey ⋮ Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems ⋮ A parametric branch and bound approach to suboptimal explicit hybrid MPC ⋮ Iterative state-space reduction for flexible computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
• Computational Efficiency of Approximate Branch-and-Bound Algorithms
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
• Branch-and-Bound Methods: A Survey
• Branch-and-Bound Methods: General Formulation and Properties
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey

This page was built for publication: Using branch-and-bound algorithms to obtain suboptimal solutions