The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design

Abstract : Let $G=(V,A)$ be a directed graph and $F$ be a set of items. The Location-Dispatching Problem consists of determining subsets $L_i \subseteq F$ located at nodes $i \in V$, minimizing the sum of two costs: a piecewise linear installation cost associated with $L_i$ and an access cost for each node of $V$ to reach a copy of each item of $F$. We formulate this problem as a linear program with binary variables $x$ and integer variables $z$. We propose a facial study of the associated polytope and we introduce the so-called integrity hop cost inequalities that force $z$ to be an integer as soon as $x$ is binary. Using this, we devise a branch-and-cut algorithm and report some experimental results. This algorithm has been used to solve Content Delivery Network instances in order to optimize a Video On Demand (VoD) system.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01185263
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 4:18:02 PM
Last modification on : Friday, May 24, 2019 - 5:26:01 PM

Links full text

Identifiers

Citation

Philippe Chrétienne, Pierre Fouilhoux, Eric Gourdin, Jean Mathieu Segura. The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design. Discrete Applied Mathematics, Elsevier, 2014, 164 (1), pp.68-85. ⟨10.1016/j.dam.2012.05.001⟩. ⟨hal-01185263⟩

Share

Metrics

Record views

201