How to whack moles
From MaRDI portal
Publication:2503357
DOI10.1016/j.tcs.2006.05.017zbMath1146.90520WikidataQ57399775 ScholiaQ57399775MaRDI QIDQ2503357
Sven O. Krumke, Tjark Vredeveld, Nicole Megow, Sandra Gutiérrez
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.017
90C60: Abstract computational complexity for mathematical programming problems
90C39: Dynamic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- News from the online traveling repairman.
- On-line algorithms for the dynamic traveling repair problem
- The Online TSP Against Fair Adversaries
- Special cases of traveling salesman and repairman problems with time windows
- Maximizing job completions online
- Algorithms for the on-line travelling salesman
- On-line single-server dial-a-ride problems