Constant-factor approximations for capacitated arc routing without triangle inequality
| Year of publication: |
2014
|
|---|---|
| Authors: | Van Bevern, René ; Hartung, Sepp ; Nichterlein, André ; Sorge, Manuel |
| Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 42.2014, 4, p. 290-292
|
| Subject: | NP-hard problem | Polynomial-time approximation | Vehicle routing | Rural postman | Chinese postman | Tourenplanung | Vehicle routing problem | Theorie | Theory |
-
Van Bevern, René, (2024)
-
Efficient neighborhood evaluations for the vehicle routing problem with multiple time windows
Hoogeboom, Maaike, (2020)
-
Slack induction by string removals for vehicle routing problems
Christiaens, Jan, (2020)
- More ...
-
Bentert, Matthias, (2022)
-
Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review
Bentert, Matthias, (2019)
-
Parameterized complexity of machine scheduling : 15 open problems
Mnich, Matthias, (2018)
- More ...