Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions
Year of publication: |
2018
|
---|---|
Authors: | Aguayo, Maichel M. ; Sarin, Subhash Chander ; Sherali, Hanif D. |
Published in: |
Journal of the Operational Research Society. - London : Taylor and Francis, ISSN 1476-9360, ZDB-ID 2007775-0. - Vol. 69.2018, 5, p. 734-746
|
Subject: | Asymmetric traveling salesman problem | scheduling | high-multiplicity | polynomial-length formulation | benders decomposition | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Dekompositionsverfahren | Decomposition method | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
-
Augmented patterns for decomposition of scheduling and assignment problems
Cappanera, Paola, (2024)
-
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 ...
-
Minimizing conditional-value-at-risk for stochastic scheduling problems
Sarin, Subhash Chander, (2014)
-
Sarin, Subhash Chander, (2014)
-
Biomass feedstock supply chain design : a taxonomic review and a decomposition-based methodology
Sun, Fangzhou, (2018)
- More ...