Pages that link to "Item:Q5959386"
From MaRDI portal
The following pages link to Locating facilities by minimax relative to closest points of demand areas (Q5959386):
Displayed 18 items.
- Heuristics for a continuous multi-facility location problem with demand regions (Q337660) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
- Continuous location model of a rectangular barrier facility (Q526636) (← links)
- On the structure of the solution set for the single facility location problem with average distances (Q543416) (← links)
- Minisum location problem with farthest Euclidean distances (Q857948) (← links)
- The maximin line problem with regional demand (Q872234) (← links)
- The single facility location problem with average-distances (Q1024705) (← links)
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122) (← links)
- An algorithm for generalized constrained multi-source Weber problem with demand substations (Q1728411) (← links)
- A biobjective approach to recoverable robustness based on location planning (Q1753588) (← links)
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
- Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
- On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
- The optimal solution set of the multi-source Weber problem (Q2414188) (← links)
- A minisum location problem with regional demand considering farthest Euclidean distances (Q2815539) (← links)
- Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)
- A new algorithm for the minimax location problem with the closest distance (Q6092935) (← links)
- Location Science in Canada (Q6102878) (← links)