Lower bounding procedure for the asymmetric quadratic traveling salesman problem
Year of publication: |
16 September 2016
|
---|---|
Authors: | Rostami, Borzou ; Malucelli, Federico ; Belotti, Pietro ; Gualandi, Stefano |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 253.2016, 3 (16.9.), p. 584-592
|
Subject: | Traveling salesman | Formulation-linearization technique | Cycle cover | Column generation | Lower bound | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem |
-
Exact algorithms for the traveling salesman problem with draft limits
Battarra, Maria, (2014)
-
Rocha, Yure, (2023)
-
The static bicycle relocation problem with demand intervals
Erdoğan, Güneş, (2014)
- More ...
-
Optimizing base station location and configuration in UMTS networks
Amaldi, Edoardo, (2006)
-
Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
Rostami, Borzou, (2014)
-
The quadratic shortest path problem : complexity, approximability, and solution methods
Rostami, Borzou, (2018)
- More ...