Pages that link to "Item:Q857948"
From MaRDI portal
The following pages link to Minisum location problem with farthest Euclidean distances (Q857948):
Displaying 6 items.
- Heuristics for a continuous multi-facility location problem with demand regions (Q337660) (← links)
- Accelerating the convergence in the single-source and multi-source Weber problems (Q428088) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
- Planning a capacitated road network with flexible travel times: a genetic algorithm (Q894559) (← links)
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
- A minisum location problem with regional demand considering farthest Euclidean distances (Q2815539) (← links)
