Constant-factor approximations for capacitated arc routing without triangle inequality
Year of publication: |
2014
|
---|---|
Authors: | Bevern, René van ; 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 |
-
On the Distance-Constrained Close Enough Arc Routing Problem
Corberán, Ángel, (2021)
-
City streets parking enforcement inspection decisions : the Chinese postman's perspective
Summerfield, Nichalin S., (2015)
-
Network search games with immobile hider, without a designated searcher starting point
Alpern, Steve, (2008)
- More ...
-
Bentert, Matthias, (2022)
-
Exact combinatorial algorithms and experiments for finding maximum k-plexes
Moser, Hannes, (2012)
-
Aspects of a multivariate complexity analysis for Rectangle Tiling
Nichterlein, André, (2011)
- More ...