Computational Efficiency of Approximate Branch-and-Bound Algorithms

DOI10.1287/MOOR.1.3.287MaRDI QIDQ4146568zbMATH OpenOpenAlexFDO

Authors Toshihide Ibaraki

Publication date 1976

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.1.3.287

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(3)

• A simulation tool for the performance evaluation of parallel branch and bound algorithms
• Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
• Using branch-and-bound algorithms to obtain suboptimal solutions

This page was built for publication: Computational Efficiency of Approximate Branch-and-Bound Algorithms

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