The location-dispatching problem: polyhedral results and content delivery network design

DOI10.1016/J.DAM.2012.05.001zbMATH Open1331.90087MaRDI QIDQ496706FDOQ496706

Authors: Philippe Chrétienne, Pierre Fouilhoux, Eric Gourdin, Jean-Mathieu Segura 

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Recommendations

• The location-dispatching problem: polyhedral results and content delivery network design
• Designing cost-effective content distribution networks
• Polyhedral analysis for concentrator location problems
• Exact algorithms for the joint object placement and request routing problem in content distribution networks
• scientific article; zbMATH DE number 2089324

zbMATH Keywords

locationpolytopebranch-and-cut algorithmcontent delivery network designinteger program

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Cites Work

• SCIP: solving constraint integer programs
• Title not available (Why is that?)
• Facility location models for distribution system design
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Computational study of large-scale \(p\)-median problems
• Title not available (Why is that?)
• Cardinality constrained combinatorial optimization: complexity and polyhedra
• On the \(p\)-median polytope
• Performance evaluation of Web proxy cache replacement policies

Cited In (3)

• A distributed transportation simplex applied to a Content Distribution Network problem
• The location-dispatching problem: polyhedral results and content delivery network design
• Filtering policies in loss queueing network location problems

Uses Software

• SCIP
• CPLEX

This page was built for publication: The location-dispatching problem: polyhedral results and content delivery network design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496706)