Pages that link to "Item:Q4837960"

The following pages link to The generalized Weber problem with expected distances (Q4837960):

Displaying 22 items.

• Heuristics for a continuous multi-facility location problem with demand regions (Q337660) (← 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)
• The geometry of optimal partitions in location problems (Q683940) (← links)
• A hybrid modified PSO approach to VaR-based facility location problems with variable capacity in fuzzy random uncertainty (Q712497) (← links)
• Minisum location problem with farthest Euclidean distances (Q857948) (← links)
• The single facility location problem with average-distances (Q1024705) (← links)
• Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
• Restricted center problems under polyhedral gauges (Q1291660) (← links)
• The Weber problem with regional demand (Q1291661) (← links)
• Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm (Q1667802) (← links)
• Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
• On the feasible set for the squared Euclidean Weber problem and applications (Q1806622) (← links)
• Solving a two-stage stochastic capacitated location-allocation problem with an improved PSO in emergency logistics (Q1993007) (← links)
• A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
• Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
• A directional approach to gradual cover (Q2421326) (← links)
• Solving the median problem with continuous demand on a network (Q2636614) (← links)
• A minisum location problem with regional demand considering farthest Euclidean distances (Q2815539) (← links)
• Optimal location of a single facility with circular demand areas (Q5948771) (← links)
• Locating facilities by minimax relative to closest points of demand areas (Q5959386) (← links)
• Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)