Improved algorithms for joint optimization of facility locations and network connections
From MaRDI portal
Publication:322548
DOI10.1016/j.ejor.2015.10.003zbMath1346.90502OpenAlexW1795617219MaRDI QIDQ322548
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.10.003
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- A survey of recent research on location-routing problems
- An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
- A primal-dual approximation algorithm for the Steiner forest problem
- New approximation algorithms for the Steiner tree problems
- General network design: a unified view of combined location and network design problems
- An 11/6-approximation algorithm for the network Steiner problem
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- A survey of variants and extensions of the location-routing problem
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- A constant-factor approximation algorithm for the k -median problem (extended abstract)
- Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem
- Efficient algorithms for a family of matroid intersection problems
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A new greedy approach for facility location problems
- Special cases of traveling salesman and repairman problems with time windows
- VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
- The Uncapacitated Facility Location Problem with Client Matching
- An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree
- Local Search Heuristics for k-Median and Facility Location Problems
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
- Steiner Tree Approximation via Iterative Randomized Rounding
- The one‐commodity pickup and delivery travelling salesman problem on a path or a tree
- Approximating k-median via pseudo-approximation
- Network design for time‐constrained delivery
- Combinatorial optimization. Theory and algorithms.
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
This page was built for publication: Improved algorithms for joint optimization of facility locations and network connections
