Pages that link to "Item:Q834581"
From MaRDI portal
The following pages link to Minimum-cost load-balancing partitions (Q834581):
Displaying 9 items.
- Geometric partitioning and robust ad-hoc network design (Q271922) (← links)
- New bounds on the average distance from the Fermat-Weber center of a planar convex body (Q665992) (← links)
- Constrained clustering via diagrams: a unified theory and its application to electoral district design (Q1695008) (← links)
- On the upper bound on the average distance from the Fermat-Weber center of a convex body (Q2230395) (← links)
- Shadow prices in territory division (Q2357931) (← links)
- Dividing a Territory Among Several Vehicles (Q2815468) (← links)
- A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body (Q2867124) (← links)
- An Approximation Algorithm for the Continuous <i>k</i>-Medians Problem in a Convex Polygon (Q2962556) (← 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)
