On a Technique for Finding Running Tracks of Specific Length in a Road Network

DOI10.1007/978-3-319-89920-6_45zbMath1397.90442OpenAlexW2803635630MaRDI QIDQ4685770

Oliver Zehner, David Willems, Stefan Ruzika

Publication date: 9 October 2018

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_45

zbMATH Keywords

combinatorial optimizationrouting problemsOR in sports

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Case-oriented studies in operations research (90B90)

Related Items (1)

Methods for determining cycles of a specific length in undirected graphs with edge weights

Cites Work

• Fibonacci heaps and their uses in improved network optimization algorithms
• Finding the K Shortest Loopless Paths in a Network
• Unnamed Item
• Unnamed Item

This page was built for publication: On a Technique for Finding Running Tracks of Specific Length in a Road Network