Approximate robust optimization for the connected facility location problem

DOI10.1016/J.DAM.2015.10.011MaRDI QIDQ299099zbMATH OpenOpenAlexFDO

Authors M. Gisela Bardossy, S. Raghavan

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)

Recommendations

• An approximation algorithm for the two-stage distributionally robust facility location problem
• An inexact sample average approximation approach for the stochastic connected facility location problem
• Dual-based local search for the connected facility location and related problems
• Almost robust discrete optimization
• Robust strategies for facility location under uncertainty

Cites work

• scientific article; zbMATH DE number 5764866 (Why is no real title available?)
• A Branch and Cut Algorithm for a Steiner Tree-Star Problem
• A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
• Dual-based local search for the connected facility location and related problems
• Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
• MIP models for connected facility location: a theoretical and computational study
• On the Asymmetric Connected Facility Location Polytope
• On the complexity of the robust spanning tree problem with interval data
• Primal-dual algorithms for connected facility location problems
• Provisioning a virtual private network: a network design problem for multicommodity flow
• Robust convex optimization
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Robust solutions of uncertain linear programs
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• The Price of Robustness
• The robust spanning tree problem with interval data

Cited in

(8)

• On the power of static assignment policies for robust facility location problems
• Combinatorial approximation algorithms for the robust facility location problem with penalties
• Deployment optimization of multi-hop wireless networks based on substitution graph
• Almost robust discrete optimization
• Connected facility location via random facility sampling and core detouring
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Approximate the lower-bounded connected facility location problem
• Approximation Algorithms for the Robust Facility Location Problem with Penalties

This page was built for publication: Approximate robust optimization for the connected facility location problem

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