Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem
Luis Gouveia, Markus Leitner, Mario Ruthmair
| 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 | Tourenplanung | Vehicle routing problem | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
| 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 |
Persistent link: https://www.econbiz.de/10011802301