Branch-and-bound and objective branching with three or more objectives
Work
Year: 2022
Type: article
Abstract: The recent success of bi-objective Branch-and-Bound (B&B) algorithms heavily relies on the efficient computation of upper and lower bound sets. These bound sets are used as a supplement to the classic... more
Source: Computers & Operations Research
Authors Nicolas Forget, Sune Lauth Gadegaard, Kathrin Klamroth, Lars Relund Nielsen, Anthony Przybylski
Institutions Aarhus University, University of Wuppertal, Nantes Université
Cites: 32
Cited by: 12
Related to: 10
FWCI: 2.169
Citation percentile (by year/subfield): 58.55
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $3,210