Exact approaches for static data segment allocation problem in an information network
From MaRDI portal
Publication:337667
DOI10.1016/j.cor.2014.05.023zbMath1348.90421OpenAlexW2052745698MaRDI QIDQ337667
Mohan Krishnamoorthy, Vishnu Narayanan, Narayan Rangaraj, Goutam Sen
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.05.023
Integer programming (90C10) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Related Items
The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems ⋮ An intermodal hub location problem for container distribution in Indonesia ⋮ Facility location models to locate data in information networks: a literature review ⋮ A study on the optimal inventory allocation for clinical trial supply chains ⋮ The Benders decomposition algorithm: a literature review
Uses Software
Cites Work
- Unnamed Item
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Facility location models to locate data in information networks: a literature review
- Adapting polyhedral properties from facility to hub location problems
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- Aggregation in hub location problems
- Designing cost-effective content distribution networks
- Exact algorithms for the joint object placement and request routing problem in content distribution networks
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Configuration of fully replicated distributed database system over wide area networks
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Preprocessing and cutting for multiple allocation hub location problems.
- A branch and cut algorithm for hub location problems with single assignment
- Network hub location problems: The state of the art
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Architecture and performance models for QoS-driven effective peering of content delivery networks
- Approximation Algorithms for Data Placement Problems
- Database Location in Computer Networks
- File allocation in a distributed database
- P-Complete Approximation Problems
- Optimal program and data locations in computer networks
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Content Placement via the Exponential Potential Function Method
- The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
- Optimal File Allocation in a Multiple Computer System
This page was built for publication: Exact approaches for static data segment allocation problem in an information network
