Clever or smart: strategies for the online target date assignment problem

DOI10.1016/j.dam.2009.08.014zbMath1185.90133OpenAlexW1991752463MaRDI QIDQ968114

Elisabeth Gassner, Sven O. Krumke, Johannes Hatzl, Sleman Saliba

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.08.014

zbMATH Keywords

competitive ratioonline target date assignment problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Online algorithms. The state of the art
• Competitive snoopy caching
• Online algorithms: a survey
• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
• Online Algorithms
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• Approximation and Online Algorithms

This page was built for publication: Clever or smart: strategies for the online target date assignment problem