Pages that link to "Item:Q1872032"
From MaRDI portal
The following pages link to Minisum location with closest Euclidean distances (Q1872032):
Displaying 20 items.
- Accelerating convergence in minisum location problem with \(\ell p\) norms (Q336624) (← links)
- 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)
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms (Q457226) (← links)
- Locating an axis-parallel rectangle on a Manhattan plane (Q458948) (← 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)
- On the location of the minimum point in the Euclidean distance sum problem (Q723341) (← links)
- Minisum location problem with farthest Euclidean distances (Q857948) (← links)
- An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions (Q1694399) (← 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)
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) (Q1942259) (← links)
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach (Q2318909) (← links)
- A minisum location problem with regional demand considering farthest Euclidean distances (Q2815539) (← links)
- Location of regional facilities (Q3724066) (← links)
- Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons (Q3790916) (← links)
- A SINGLE FACILITY MINISUM LOCATION PROBLEM UNDER THE A-DISTANCE (Q4367068) (← links)
- Locating facilities by minimax relative to closest points of demand areas (Q5959386) (← links)
