Cost thresholds for dynamic resource location

DOI10.1016/J.DAM.2007.09.002MaRDI QIDQ944737zbMATH OpenOpenAlexFDO

Authors David 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

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

Recommendations

• Dynamic resource location with tropical algebra
• Parametrized relocation of low-mobility resources
• Dynamic location problems with limited look-ahead
• Optimal algorithms for page migration in dynamic networks
• Resource relocation on asymmetric networks

Cites work

• scientific article; zbMATH DE number 4049076 (Why is no real title available?)
• scientific article; zbMATH DE number 65703 (Why is no real title available?)
• A dynamic location problem for graphs
• Fixed-edge theorem for graphs with loops
• On page migration and other relaxed task systems
• Page Migration Algorithms Using Work Functions
• Retracts of hypercubes

Cited in

(3)

• Parametrized relocation of low-mobility resources
• Kazhdan and Haagerup properties from the median viewpoint.
• Resource relocation on asymmetric networks

This page was built for publication: Cost thresholds for dynamic resource location

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