Covering tours and cycle covers with turn costs: hardness and approximation
From MaRDI portal
Publication:2294052
DOI10.1007/978-3-030-17402-6_19OpenAlexW2887688500MaRDI QIDQ2294052
Sándor P. Fekete, Dominik Krupke
Publication date: 6 February 2020
Full work available at URL: https://arxiv.org/abs/1808.04417
Related Items (2)
SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning ⋮ Minimum Scan Cover with Angular Transition Costs
This page was built for publication: Covering tours and cycle covers with turn costs: hardness and approximation
