The following pages link to (Q4526991):
Displaying 50 items.
- Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties) (Q260252) (← links)
- Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Finding a collective set of items: from proportional multirepresentation to group recommendation (Q334810) (← links)
- An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties (Q384185) (← links)
- An approximation algorithm for the dynamic facility location problem with submodular penalties (Q403471) (← links)
- An approximation algorithm for the \(k\)-level concentrator location problem (Q408401) (← links)
- Fast approximate energy minimization with label costs (Q409135) (← links)
- Improved approximation algorithms for the robust fault-tolerant facility location problem (Q436327) (← links)
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← links)
- LP-rounding algorithms for the fault-tolerant facility placement problem (Q491622) (← links)
- Observations on some heuristic methods for the capacitated facility location problem (Q505112) (← links)
- A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
- A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
- Capacitated domination problem (Q534769) (← links)
- The vendor location problem (Q547116) (← links)
- Incremental facility location problem and its competitive algorithms (Q604759) (← links)
- An approximation algorithm for the \(k\)-level stochastic facility location problem (Q613331) (← links)
- An approximation algorithm for the \(k\)-level capacitated facility location problem (Q613660) (← links)
- Optimizing server placement in distributed systems in the presence of competition (Q635301) (← links)
- A primal-dual approximation algorithm for stochastic facility location problem with service installation costs (Q644537) (← links)
- LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
- LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
- Fault-tolerant concave facility location problem with uniform requirements (Q692668) (← links)
- A simple and deterministic competitive algorithm for online facility location (Q703850) (← links)
- A simple tabu search for warehouse location (Q703910) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- An approximation algorithm for the stochastic fault-tolerant facility location problem (Q743782) (← links)
- Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
- A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems (Q747779) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
- Approximation algorithms for facility location problems with a special class of subadditive cost functions (Q860875) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- A review of hierarchical facility location models (Q868995) (← links)
- Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
- Recovery guarantees for exemplar-based clustering (Q897656) (← links)
- Approximation algorithms for the priority facility location problem with penalties (Q905151) (← links)
- A primal-dual algorithm for online non-uniform facility location (Q924552) (← links)
- Approximation algorithm for facility location with service installation costs (Q924885) (← links)
- A new approximation algorithm for the multilevel facility location problem (Q968163) (← links)
- Kinetic facility location (Q970606) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Approximation algorithms for connected facility location problems (Q1016041) (← links)
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems (Q1026247) (← links)
- An improved approximation algorithm for uncapacitated facility location problem with penalties (Q1029272) (← links)
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties (Q1041733) (← links)
- A cross-monotonic cost sharing method for the facility location game with service installation costs (Q1047875) (← links)
