Pages that link to "Item:Q3988705"
From MaRDI portal
The following pages link to The Facility Location Problem with Limited Distances (Q3988705):
Displaying 15 items.
- New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
- New local searches for solving the multi-source Weber problem (Q512988) (← links)
- Maximizing the minimum cover probability by emergency facilities (Q512997) (← links)
- Solving a continuous local access network design problem with a stabilized central column generation approach (Q635164) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- Stabilized column generation (Q1297485) (← links)
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) (← links)
- A d.c. optimization method for single facility location problems (Q1904649) (← links)
- The continuous knapsack problem with capacities (Q2059181) (← links)
- On the Weber facility location problem with limited distances and side constraints (Q2448124) (← links)
- A stochastic gradual cover location problem (Q3560226) (← links)
- Location Problems with Cutoff (Q6053539) (← links)
- A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification (Q6164583) (← links)
