Cost thresholds for dynamic resource location

DOI10.1016/j.dam.2007.09.002zbMath1152.05379OpenAlexW2117137437MaRDI QIDQ944737

D. Jacob Wildstrom

Publication date: 10 September 2008

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

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

zbMATH Keywords

dynamic optimizationlookaheaddynamic locationwindow index

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Parametrized relocation of low‐mobility resources ⋮ Kazhdan and Haagerup properties from the median viewpoint.

Cites Work

• A dynamic location problem for graphs
• Retracts of hypercubes
• Fixed-edge theorem for graphs with loops
• Page Migration Algorithms Using Work Functions
• On page migration and other relaxed task systems
• Unnamed Item
• Unnamed Item