Budgeted prize-collecting traveling salesman and minimum spanning tree problems
Alice Paul, Daniel Freund, Aaron Ferber, David B. Shmoys, David P. Williamson
| Year of publication: |
2020
|
|---|---|
| Authors: | Paul, Alice ; Freund, Daniel ; Ferber, Aaron ; Shmoys, David Bernard ; Williamson, David P. |
| Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 45.2020, 2, p. 576-590
|
| Subject: | approximation algorithms | traveling salesman problem | constrained optimization | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Graphentheorie | Graph theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
| Description of contents: | Description [pubsonline.informs.org] |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Notes: | Erratum enthalten in: Vol., No. 4, November 2023, Seite 2304-2307 |
| Other identifiers: | 10.1287/moor.2019.1002 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012242522