scientific article
From MaRDI portal
Publication:2728895
zbMath0971.68636MaRDI QIDQ2728895
D. Hauptmeier, Jörg Rambau, Sven O. Krumke
Publication date: 4 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Online \(k\)-server routing problems ⋮ On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis ⋮ A hard dial-a-ride problem that is easy on average ⋮ Tight analysis of the lazy algorithm for open online dial-a-ride ⋮ Unnamed Item ⋮ An improved algorithm for open online dial-a-ride ⋮ Improved bounds for open online dial-a-ride on the line ⋮ Computational bounds for elevator control policies by large scale linear programming ⋮ Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line ⋮ On the power of lookahead in on-line server routing problems ⋮ New policies for the dynamic traveling salesman problem ⋮ Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models ⋮ Unnamed Item ⋮ How to whack moles ⋮ An adversarial queueing model for online server routing ⋮ An Improved Online Algorithm for the Traveling Repairperson Problem on a Line ⋮ Dynamic pickup and delivery problems ⋮ Two short notes on the on-line travelling salesman: handling times and lookahead.
This page was built for publication:
