The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design - Archive ouverte HAL Access content directly
Conference Papers Year :

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

Philippe Chrétienne
  • Function : Author
  • PersonId : 968920
Pierre Fouilhoux
Eric Gourdin
  • Function : Author
Jean Mathieu Segura
  • Function : Author
  • PersonId : 979941

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.
No file

Dates and versions

hal-01291272 , version 1 (21-03-2016)

Identifiers

  • HAL Id : hal-01291272 , version 1

Cite

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⟩
46 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More