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

DOI10.1016/j.dam.2012.05.001zbMath1331.90087MaRDI QIDQ496706

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

Publication date: 22 September 2015

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

zbMATH Keywords

branch-and-cut algorithmpolytopelocationinteger programcontent delivery network design

Mathematics Subject Classification ID

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

Uses Software

• SCIP
• CPLEX

Cites Work

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

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