Computational Efficiency of Approximate Branch-and-Bound Algorithms

DOI10.1287/moor.1.3.287zbMath0369.90090OpenAlexW2134363021MaRDI QIDQ4146568

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)

Related Items (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