ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS

DOI10.15807/JORSJ.20.16MaRDI QIDQ4139973zbMATH OpenOpenAlexFDO

Authors Toshihide Ibaraki

Publication date 1977

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.20.16

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited in

(3)

• A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions
• Using branch-and-bound algorithms to obtain suboptimal solutions
• Towards an abstract parallel branch and bound machine

This page was built for publication: ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS

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