The Steiner Traveling Salesman Problem and its extensions
Year of publication: |
2019
|
---|---|
Authors: | Rodríguez-Pereira, Jessica ; Fernández, Elena ; Laporte, Gilbert ; Benavent, Enrique ; Martínez-Sykora, Antonio |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 278.2019, 2 (16.10.), p. 615-628
|
Subject: | Steiner Traveling Salesman Problem | Integer linear programming | Branch-and-cut | Valid inequalities | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming |
-
An integer programming approach for the time-dependent traveling salesman problem with time windows
Montero, Agustín, (2017)
-
Gouveia, Luis, (2017)
-
Solving the Traveling Salesman Problem with release dates via branch and cut
Montero, Agustín, (2023)
- More ...
-
Multi-depot Multiple TSP : a polyhedral study and computational results
Benavent, Enrique, (2013)
-
Voxel-based solution approaches to the three-dimensional irregular packing problem
Lamas-Fernandez, Carlos, (2023)
-
Martínez-Sykora, Antonio, (2014)
- More ...