Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
Year of publication: |
2019
|
---|---|
Authors: | Gadegaard, Sune Lauth ; Nielsen, Lars Relund ; Ehrgott, Matthias |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 31.2019, 4, p. 790-804
|
Subject: | bi-objective branch-and-cut | bi-objective optimization | combinatorial optimization | branch-and-cut | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem |
-
Silva, Allyson, (2021)
-
Maximum weighted induced forests and trees : new formulations and a computational comparative review
Melo, Rafael A., (2022)
-
Exact approaches for the minimum subgraph diameter problem
Dadalto, Arthur Pratti, (2023)
- More ...
-
An improved cut-and-solve algorithm for the single-source capacitated facility location problem
Gadegaard, Sune Lauth, (2018)
-
A bi-objective approach to discrete cost-bottleneck location problems
Gadegaard, Sune Lauth, (2018)
-
Forget, Nicolas, (2022)
- More ...