A new branch-and-cut algorithm for the generalized directed rural postman problem
Thais Ávila, Ángel Corberán (Departamento d’Estadística i Investigació Operativa, Universitat de València, Valencia, Spain), Isaac Plana (Departamento de Matemáticas para la Economía y la Empresa, Universitat de València, Valencia, Spain), José M. Sanchis (Departamento de Matemática Aplicada, Universidad Politécnica de València, Valencia, Spain)
| Year of publication: |
May 2016
|
|---|---|
| Authors: | Ávila, Thais ; Corberán, Ángel ; Plana, Isaac ; Sanchis, José M. |
| Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 50.2016, 2, p. 750-761
|
| Subject: | generalized rural postman problem | close-enough arc routing problem | branch-and-cut | Tourenplanung | Vehicle routing problem | Theorie | Theory | Algorithmus | Algorithm |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/trsc.2015.0588 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011491142