Pages that link to "Item:Q3686392"

The following pages link to The Solution of Distance Constrained Mini-Sum Location Problems (Q3686392):

Displaying 11 items.

• The multi-facility min-max Weber problem (Q795710) (← links)
• Minisum location problem with farthest Euclidean distances (Q857948) (← links)
• On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) (Q1942259) (← links)
• Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances (Q2192465) (← links)
• The minimum equitable radius location problem with continuous demand (Q2378371) (← links)
• A minisum location problem with regional demand considering farthest Euclidean distances (Q2815539) (← links)
• The weighted minimax location problem with set-up costs and extensions (Q3360659) (← links)
• The Minisum and Minimax Location Problems Revisited (Q3705190) (← links)
• A squared-euclidean distance location-allocation problem (Q4005859) (← links)
• MINIMAX LOCATION PROBLEM WITH A-DISTANCE (Q4538098) (← links)
• Quality locations for the constrained minimax location model (Q4693338) (← links)