Mathematical formulations for consistent travelling salesman problems
Year of publication: |
2024
|
---|---|
Authors: | Díaz-Ríos, Daniel ; Salazar-González, Juan-José |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 313.2024, 2 (1.3.), p. 465-477
|
Subject: | Benders’ decomposition | Branch and cut | Time consistency | Travelling salesman | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Dekompositionsverfahren | Decomposition method |
-
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
Gendreau, Michel, (2015)
-
Aguayo, Maichel M., (2018)
-
Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
Cornu, Marek, (2017)
- More ...
-
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
Hernández-Pérez, Hipólito, (2009)
-
Comments on: Routing problems with loading constraints
Salazar-González, Juan-José, (2010)
-
Statistical confidentiality: optimization techniques to protect tables
Salazar-González, Juan-José, (2008)
- More ...