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 Li⊆F,i∈V, minimizing the sum of two costs: an installation cost associated with nodes i of V such that Li≠∅ and an access cost to each item of F. We formulate this problem as an integer linear program and propose a facial study of the associated polytope. We describe valid inequalities and give sufficient conditions for these inequalities to be facet defining. Using this, we devise a Branch-and-Cut algorithm and report some preliminary 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 :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01291272
Contributor : Lip6 Publications <>
Submitted on : Monday, March 21, 2016 - 11:38:08 AM
Last modification on : Thursday, March 21, 2019 - 1:14:18 PM

Identifiers

  • HAL Id : hal-01291272, version 1

Citation

Philippe Chrétienne, Pierre Fouilhoux, Eric Gourdin, Jean Mathieu Segura. The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design. International Symposium on Combinatorial Optimization (ISCO 2010), Electronic Notes in Discrete Mathematics, Elsevier., Mar 2010, Hammamet, Tunisia. pp.867-874. ⟨hal-01291272⟩

Share

Metrics

Record views

85