Pages that link to "Item:Q2815539"

The following pages link to A minisum location problem with regional demand considering farthest Euclidean distances (Q2815539):

Displaying 11 items.

• 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)
• Minisum location problem with farthest Euclidean distances (Q857948) (← links)
• The maximin line problem with regional demand (Q872234) (← links)
• Minisum location with closest Euclidean distances (Q1872032) (← links)
• A note on the formal implementation of the \(K\)-means algorithm with hard positive and negative constraints (Q2220707) (← links)
• Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
• The minimum equitable radius location problem with continuous demand (Q2378371) (← links)
• Location of regional facilities (Q3724066) (← links)
• Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons (Q3790916) (← links)
• A squared-euclidean distance location-allocation problem (Q4005859) (← links)