The following pages link to (Q3840357):
Displaying 31 items.
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- Incremental facility location problem and its competitive algorithms (Q604759) (← links)
- A simple tabu search for warehouse location (Q703910) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Approximation algorithms for facility location problems with a special class of subadditive cost functions (Q860875) (← links)
- Computational study of large-scale \(p\)-median problems (Q868446) (← links)
- Approximation algorithm for facility location with service installation costs (Q924885) (← 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)
- An 0. 828-approximation algorithm for the uncapacitated facility location problem (Q1296569) (← links)
- An improved branch \& bound method for the uncapacitated competitive location problem (Q1413748) (← links)
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem (Q1604042) (← links)
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem (Q1607016) (← links)
- Improved approximation algorithms for capacitated facility location problems (Q1771310) (← links)
- Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171) (← links)
- Near-optimal solutions to large-scale facility location problems (Q1779687) (← links)
- The General Steiner Tree-Star problem. (Q1853139) (← links)
- Improved approximation algorithms for multilevel facility location problems (Q1866994) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
- LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem (Q2271817) (← links)
- On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- The approximation gap for the metric facility location problem is not yet closed (Q2467481) (← links)
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem (Q3012910) (← links)
- (Q3598875) (← links)
- Greedy Strikes Back: Improved Facility Location Algorithms (Q4240134) (← links)
- The facility location problem with general cost functions (Q4422623) (← links)
- On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem (Q5443801) (← links)
- The Priority k-Median Problem (Q5458823) (← links)
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem (Q5901421) (← links)
