The following pages link to (Q4945109):
Displaying 13 items.
- 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)
- Minisum location problem with farthest Euclidean distances (Q857948) (← links)
- The single facility location problem with average-distances (Q1024705) (← 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)
- 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)
- Optimal multifacility defensive location on planes with rectilinear distances (Q3141108) (← links)
- Locating facilities by minimax relative to closest points of demand areas (Q5959386) (← links)
- Supply facility and input/output point locations in the presence of barriers (Q5959390) (← links)
