Exact approaches for static data segment allocation problem in an information network
From MaRDI portal
(Redirected from Publication:337667)
Recommendations
- A benders decomposition approach for static data segment location to servers connected by a tree backbone
- A constrained nonlinear 0-1 program for data allocation
- Facility location models to locate data in information networks: a literature review
- Database Location in Computer Networks
- scientific article; zbMATH DE number 4209580
Cites work
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A branch and cut algorithm for hub location problems with single assignment
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Adapting polyhedral properties from facility to hub location problems
- Aggregation in hub location problems
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Approximation Algorithms for Data Placement Problems
- Architecture and performance models for QoS-driven effective peering of content delivery networks
- Benders decomposition for large-scale uncapacitated hub location
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Configuration of fully replicated distributed database system over wide area networks
- Content placement via the exponential potential function method
- Database Location in Computer Networks
- Designing cost-effective content distribution networks
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Exact algorithms for the joint object placement and request routing problem in content distribution networks
- Facility location models to locate data in information networks: a literature review
- File allocation in a distributed database
- Network hub location problems: The state of the art
- Optimal File Allocation in a Multiple Computer System
- Optimal program and data locations in computer networks
- P-Complete Approximation Problems
- Preprocessing and cutting for multiple allocation hub location problems.
- The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
- Tight linear programming relaxations of uncapacitated p-hub median problems
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
Cited in
(9)- A constrained nonlinear 0-1 program for data allocation
- An intermodal hub location problem for container distribution in Indonesia
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
- Multiskilled workforce staffing and scheduling: a logic-based Benders' decomposition approach
- The Benders decomposition algorithm: a literature review
- A study on the optimal inventory allocation for clinical trial supply chains
- A benders decomposition approach for static data segment location to servers connected by a tree backbone
- Algorithms – ESA 2005
- Facility location models to locate data in information networks: a literature review
This page was built for publication: Exact approaches for static data segment allocation problem in an information network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337667)
