Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost

DOI10.1137/1.9781611975499.15zbMath1430.68199OpenAlexW2908190952MaRDI QIDQ5232766

Sándor P. Fekete, Dominik Krupke

Publication date: 13 September 2019

Published in: 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975499.15

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

Minimum Scan Cover with Angular Transition Costs

This page was built for publication: Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost