Pages that link to "Item:Q3009767"
From MaRDI portal
The following pages link to Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767):
Displaying 13 items.
- Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
- LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
- The online multicommodity connected facility location problem (Q1644930) (← links)
- The connected facility location polytope (Q1686059) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- Primal-dual algorithms for connected facility location problems (Q1884770) (← links)
- Computing a tree having a small vertex cover (Q2272400) (← links)
- Approximate the lower-bounded connected facility location problem (Q2695316) (← links)
- LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design (Q3449835) (← links)
- (Q4411292) (← links)
- Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem (Q4922116) (← links)
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems (Q5283361) (← links)