Pages that link to "Item:Q1291661"

The following pages link to The Weber problem with regional demand (Q1291661):

Displaying 12 items.

• Heuristics for a continuous multi-facility location problem with demand regions (Q337660) (← links)
• A projected Weiszfeld algorithm for the box-constrained Weber location problem (Q425491) (← links)
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
• Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
• On the structure of the solution set for the single facility location problem with average distances (Q543416) (← links)
• The geometry of optimal partitions in location problems (Q683940) (← links)
• A continuous analysis framework for the solution of location-allocation problems with dense demand (Q733530) (← links)
• Minisum location problem with farthest Euclidean distances (Q857948) (← links)
• The maximin line problem with regional demand (Q872234) (← 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)
• Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)