Search
Frontpage
Staff
Prizes
Equipment
Projects
Activities
Research units
Research output
Press/Media
About
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
Research output
:
Contribution to journal
›
Article
›
peer-review
Algorithmics Laboratory
Theoretical Cybernetics Section
Laboratory for Theoretical and Experimental Simulation of New Photonic Devices
Overview
Cite this
DOI
https://doi.org/10.1002/net.21742
Final published version
René van Bevern
Christian Komusiewicz
Manuel Sorge
Original language
English
Pages (from-to)
262-278
Number of pages
17
Journal
Networks
Volume
70
Issue number
3
DOIs
https://doi.org/10.1002/net.21742
Publication status
Published -
1 Oct 2017
Research areas
Chinese Postman, combinatorial optimization, fixed-parameter algorithm, NP-hard problem, Rural Postman, transportation, vehicle routing, EULERIAN EXTENSION, BOUNDS
OECD FOS+WOS
ID: 9087731
