Dynamic Traveling Repair Problem with an Arbitrary Time Window

DOI10.1007/978-3-319-51741-4_2zbMath1484.68334OpenAlexW2568879887MaRDI QIDQ2971153

Adi Vardi, Yossi Azar

Publication date: 4 April 2017

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51741-4_2

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Related Items (1)

The temporal explorer who returns to the base

Cites Work

• Unnamed Item
• Buffer management for colored packets with deadlines
• 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
• On-line algorithms for the dynamic traveling repair problem
• Approximating a vehicle scheduling problem with time windows and handling times
• Improved algorithms for orienteering and related problems
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• The orienteering problem
• Special cases of traveling salesman and repairman problems with time windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
• Online traveling salesman problems with rejection options
• On approximating a geometric prize-collecting traveling salesman problem with time windows
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Approximation and Online Algorithms
• Algorithms for the on-line travelling salesman
• On-line single-server dial-a-ride problems

This page was built for publication: Dynamic Traveling Repair Problem with an Arbitrary Time Window