scientific article; zbMATH DE number 1629851

MaRDI QIDQ2728895zbMATH OpenFDO

Authors D. Hauptmeier, Sven O. Krumke, Jörg Rambau

Publication date 4 November 2001

zbMATH Keywords

analysis of online-algorithmsonline dial-a-ride problemstability criterion

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms (68W40)

Recommendations

• Stability with Uniform Bounds for On-line Dial-a-Ride Problems under Reasonable Load
• On-line single-server dial-a-ride problems
• Competitive analysis of the online dial-a-ride problem
• scientific article; zbMATH DE number 1629830
• Maximizing Revenues for On-Line Dial-a-Ride

Cited in

(26)

• Dynamic pickup and delivery problems
• Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP
• Two short notes on the on-line travelling salesman: handling times and lookahead.
• Computational bounds for elevator control policies by large scale linear programming
• Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
• How to whack moles
• Improved bounds for open online dial-a-ride on the line
• Maximizing Revenues for On-Line Dial-a-Ride
• The optimality of the online greedy algorithm in carpool and chairman assignment problems
• Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
• Competitive analysis of the online dial-a-ride problem
• Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
• An improved online algorithm for the traveling repairperson problem on a line
• scientific article; zbMATH DE number 7204578 (Why is no real title available?)
• Stability with Uniform Bounds for On-line Dial-a-Ride Problems under Reasonable Load
• On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis
• New policies for the dynamic traveling salesman problem
• scientific article; zbMATH DE number 7650088 (Why is no real title available?)
• Tight analysis of the lazy algorithm for open online dial-a-ride
• An improved algorithm for open online dial-a-ride
• Tight analysis of the lazy algorithm for open online dial-a-ride
• Traveling repairperson, unrelated machines, and other stories about average completion times
• Online k-server routing problems
• A hard dial-a-ride problem that is easy on average
• On the power of lookahead in on-line server routing problems
• An adversarial queueing model for online server routing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2728895)