Branch-and-bound and objective branching with three or more objectives
Year of publication: |
2022
|
---|---|
Authors: | Forget, Nicolas ; Gadegaard, Sune Lauth ; Klamroth, Kathrin ; Nielsen, Lars Relund ; Przybylski, Anthony |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 148.2022, p. 1-16
|
Subject: | Multi-objective combinatorial optimization | Multi-objective integer programming | Branch & bound | Objective branching | Bound sets | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound |
-
Enhancing branch-and-bound for multiobjective 0-1 programming
Forget, Nicolas, (2024)
-
Liu, Cheng-Hsiang, (2016)
-
Neto, Teresa, (2013)
- More ...
-
Forget, Nicolas, (2022)
-
An improved cut-and-solve algorithm for the single-source capacitated facility location problem
Gadegaard, Sune Lauth, (2018)
-
Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
Gadegaard, Sune Lauth, (2019)
- More ...