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 |
-
The interval min-max regret knapsack packing-delivery problem
Wang, Shijin, (2021)
-
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
Gendreau, Michel, (2015)
-
A decomposition algorithm for the consistent traveling salesman problem with vehicle idling
Subramanyam, Anirudh, (2018)
- More ...
-
Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem
Letchford, Adam N., (2015)
-
A new approach for data editing and imputation
Delgado-Quintero, Sergio, (2008)
-
Salazar-González, Juan-José, (2014)
- More ...