Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
Year of publication: |
2016
|
---|---|
Authors: | Letchford, Adam N. ; Salazar-González, Juan-José |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 251.2016, 1 (16.5.), p. 74-84
|
Subject: | Sequential ordering | Travelling salesman problem with precedence constraints | Multi-commodity flows | Metrics | Polyhedral combinatorics | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming |
-
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
Dell'Amico, Mauro, (2020)
-
A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
Sousa, Marques Moreira de, (2021)
-
Geometric and LP-based heuristics for angular travelling salesman problems in the plane
Staněk, Rostislav, (2019)
- More ...
-
Decorous Lower Bounds for Minimum Linear Arrangement
Caprara, Alberto, (2011)
-
Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem
Letchford, Adam N., (2015)
-
The Capacitated Vehicle Routing Problem : stronger bounds in pseudo-polynomial time
Letchford, Adam N., (2019)
- More ...