Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem
Year of publication: |
1 November 2017
|
---|---|
Authors: | Gouveia, Luis ; Leitner, Markus ; Ruthmair, Mario |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 262.2017, 3 (1.11.), p. 908-928
|
Subject: | Traveling Salesman Problem | Distance constraint | Integer Linear Programming | Layered graph | Branch-and-cut | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem |
Description of contents: | Description [sciencedirect.com] |
Type of publication: | Article |
---|---|
Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
Language: | English |
Notes: | Corrigendum enthalten in: Volume 285, Issue 3, 16 September 2020, Seite 1199-1203 |
Other identifiers: | 10.1016/j.ejor.2017.04.061 [DOI] |
Source: | ECONIS - Online Catalogue of the ZBW |
-
The Steiner Traveling Salesman Problem and its extensions
Rodríguez-Pereira, Jessica, (2019)
-
An integer programming approach for the time-dependent traveling salesman problem with time windows
Montero, Agustín, (2017)
-
Solving the Traveling Salesman Problem with release dates via branch and cut
Montero, Agustín, (2023)
- More ...
-
Layered graph approaches for combinatorial optimization problems
Gouveia, Luis, (2019)
-
Multi-depot routing with split deliveries : models and a branch-and-cut algorithm
Gouveia, Luis, (2023)
-
Large-scale influence maximization via maximal covering location
Güney, Evren, (2021)
- More ...