Approximate robust optimization for the connected facility location problem

DOI10.1016/j.dam.2015.10.011zbMath1345.90054OpenAlexW2210829295MaRDI QIDQ299099

F. Blanchet-Sadri, M. Dambrine

Publication date: 22 June 2016

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

Full work available at URL: https://doi.org/10.1016/j.dam.2015.10.011

zbMATH Keywords

heuristicsapproximationrobust optimizationnetwork designconnected facility location problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Discrete location and assignment (90B80)

Related Items

Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Deployment optimization of multi-hop wireless networks based on substitution graph

Cites Work

• Unnamed Item
• MIP models for connected facility location: a theoretical and computational study
• Robust solutions of uncertain linear programs
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• On the complexity of the robust spanning tree problem with interval data
• Primal-dual algorithms for connected facility location problems
• A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
• Robust Convex Optimization
• Dual-Based Local Search for the Connected Facility Location and Related Problems
• On the Asymmetric Connected Facility Location Polytope
• The Price of Robustness
• Provisioning a virtual private network
• Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• A Branch and Cut Algorithm for a Steiner Tree-Star Problem
• The robust spanning tree problem with interval data