A benders decomposition approach for static data segment location to servers connected by a tree backbone
DOI10.1007/978-3-319-42902-1_15zbMATH Open1375.90266OpenAlexW2594088733MaRDI QIDQ4596201FDOQ4596201
Narayan Rangaraj, Goutam Sen, Vishnu Narayanan, Mohan Krishnamoorthy
Publication date: 1 December 2017
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-42902-1_15
Recommendations
- Exact approaches for static data segment allocation problem in an information network
- Benders decomposition of the passive optical network design problem
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Designing cost-effective content distribution networks
- Benders decomposition without separability: a computational study for capacitated facility location problems
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Uses Software
This page was built for publication: A benders decomposition approach for static data segment location to servers connected by a tree backbone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596201)
