Exact algorithms for the joint object placement and request routing problem in content distribution networks
From MaRDI portal
Publication:925830
DOI10.1016/j.cor.2007.02.005zbMath1278.90072OpenAlexW1975651401MaRDI QIDQ925830
Gilbert Laporte, Tolga Bektaş, Jean-François Cordeau, Erhan Erkut
Publication date: 23 May 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/22909
linearizationBenders decompositionOR in telecommunicationscontent distribution networkLagrangean relaxation and decomposition
Related Items
Exact approaches for static data segment allocation problem in an information network, Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding, Facility location models to locate data in information networks: a literature review
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facility location models for distribution system design
- Designing cost-effective content distribution networks
- Joint object placement and node dimensioning for internet content distribution
- An integer programming model for the allocation of databases in a distributed computer system
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Partitioning procedures for solving mixed-variables programming problems
- Configuration of fully replicated distributed database system over wide area networks
- Monge strikes again: Optimal placement of web proxies in the internet
- Formulating logical implications in combinatorial optimisation
- A survey on Benders decomposition applied to fixed-charge network design problems
- Provisioning overlay distribution networks
- Resource allocation and capacity assignment in distributed systems
- Placement Algorithms for Hierarchical Cooperative Caching
- File distribution in networks with multimedia storage servers
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Database Location in Computer Networks
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Locating replicas of a database on a network
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Validation of subgradient optimization
