A generic branch-and-cut algorithm for multiobjective optimization problems : application to the multilabel traveling salesman problem
Year of publication: |
2012
|
---|---|
Authors: | Jozefowiez, Nicolas ; Laporte, Gilbert ; Semet, Frédéric |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 24.2012, 4, p. 554-564
|
Subject: | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
Cornu, Marek, (2017)
-
Haeri, Abdorrahman, (2012)
-
Tool path optimisation method for large thin-wall part of spacecraft
Wang, Haichao, (2018)
- More ...
-
A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
Jozefowiez, Nicolas, (2011)
-
Jozefowiez, Nicolas, (2012)
-
Meta partial benders decomposition for the logistics service network design problem
Belieres, Simon, (2022)
- More ...