Approximate robust optimization for the connected facility location problem
From MaRDI portal
Publication:299099
DOI10.1016/J.DAM.2015.10.011zbMATH Open1345.90054OpenAlexW2210829295MaRDI QIDQ299099FDOQ299099
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
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
- The Price of Robustness
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Robust convex optimization
- The robust spanning tree problem with interval data
- 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
- Dual-based local search for the connected facility location and related problems
- On the Asymmetric Connected Facility Location Polytope
- Title not available (Why is that?)
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- A Branch and Cut Algorithm for a Steiner Tree-Star Problem
- MIP models for connected facility location: a theoretical and computational study
Cited In (8)
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Deployment optimization of multi-hop wireless networks based on substitution graph
- On the power of static assignment policies for robust facility location problems
- Connected facility location via random facility sampling and core detouring
- Approximate the lower-bounded connected facility location problem
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- Almost robust discrete optimization
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)
