Polynomially solvable cases of the bipartite traveling salesman problem
Year of publication: |
1 March 2017
|
---|---|
Authors: | García, Alfredo ; Tejel, Javier |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 257.2017, 2 (1.3.), p. 429-438
|
Subject: | Traveling salesman | Combinatorial optimization | Bipartite traveling salesman | quadrangle property | Kalmanson matrix | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem |
-
Pereira, Armando Honorio, (2022)
-
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
-
Load-dependent and precedence-based models for pickup and delivery problems
Gouveia, Luis, (2015)
- More ...
-
Modeling electricity markets : a brief introduction
García, Alfredo, (2010)
-
Investment dynamics in electricity markets
García, Alfredo, (2011)
-
Market structure and the competitive effects of switching costs
Fabra, Natalia, (2015)
- More ...