Pages that link to "Item:Q337660"
From MaRDI portal
The following pages link to Heuristics for a continuous multi-facility location problem with demand regions (Q337660):
Displaying 5 items.
- An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions (Q1694399) (← 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)
- Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)
- A faster algorithm for the constrained minimum covering circle problem to expedite solving <i>p</i>‐center problems in an irregularly shaped area with holes (Q6053130) (← links)
