Using branch-and-bound algorithms to obtain suboptimal solutions

DOI10.1007/BF01916914zbMATH Open0527.65043OpenAlexW1995576106MaRDI QIDQ3042297FDOQ3042297

Authors:

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)

Cites Work

• Title not available (Why is that?)
• Branch-and-Bound Methods: A Survey
• Branch-and-Bound Methods: General Formulation and Properties
• Title not available (Why is that?)
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• 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¯
• Title not available (Why is that?)
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
• Computational Efficiency of Approximate Branch-and-Bound Algorithms

Cited In (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

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

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