Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems
Year of publication: |
July/September 2015
|
---|---|
Authors: | Sarpong, Boadu Mensah ; Artigues, Christian ; Jozefowiez, Nicolas |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 49.2015, 3, p. 527-554
|
Subject: | Multi-objective optimization | bound sets | combinatorial optimization | column generation | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis |
-
Artigues, Christian, (2018)
-
Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
Kalita, Zahnupriya, (2014)
-
Branch-and-bound and objective branching with three or more objectives
Forget, Nicolas, (2022)
- More ...
-
A matheuristic with fixed-sequence reoptimization for a real-life inventory routing problem
He, Yun, (2020)
-
Artigues, Christian, (2018)
-
A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
Jozefowiez, Nicolas, (2011)
- More ...