THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS

DOI10.15807/jorsj.25.292zbMath0505.90054OpenAlexW2182290077MaRDI QIDQ4742560

Toshihide Ibaraki

Publication date: 1982

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.25.292

zbMATH Keywords

computational efficiencydominance testlower bound testefficiency of branch and bound algorithmstightness of upper and lower bounding functionstightning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (2)

Scheduling unit-time tasks in renewable resource constrained flowshops ⋮ A branch-and-bound approach to the no-idle flowshop scheduling problem

This page was built for publication: THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS