Dynamic evolution of economically preferred facilities

DOI10.1016/j.ejor.2007.07.027zbMath1151.90017OpenAlexW2023729699MaRDI QIDQ954890

Dorit S. Hochbaum

Publication date: 18 November 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.07.027

zbMATH Keywords

minimum cutlocationdense subgraphsevolution of facilitiesfacilities planning

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Optimal hierarchical clustering on a graph

Cites Work

• On the \(k\)-cut problem
• A new approach to the maximum-flow problem
• Improved Algorithms for Bipartite Network Flow
• A Fast Parametric Maximum Flow Algorithm and Applications
• A Selection Problem of Shared Fixed Costs and Network Flows
• Notes—On a Selection Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item