Pages that link to "Item:Q1148209"

The following pages link to Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle (Q1148209):

Displaying 36 items.

• The Weber problem in congested regions with entry and exit points (Q337649) (← links)
• A planar single facility location and border crossing problem (Q339663) (← links)
• A projected Weiszfeld algorithm for the box-constrained Weber location problem (Q425491) (← links)
• On the use of the varignon frame for single facility Weber problems in the presence of convex barriers (Q439364) (← links)
• A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations (Q473730) (← links)
• Location models with stochastic demand points (Q505108) (← links)
• Continuous location model of a rectangular barrier facility (Q526636) (← links)
• A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
• Planar location problems with block distance and barriers (Q816413) (← links)
• An efficient solution method for Weber problems with barriers based on genetic algorithms (Q856193) (← links)
• Placing a finite size facility with a center objective on a rectangular plane with barriers (Q864036) (← links)
• The multi-facility location-allocation problem with polyhedral barriers (Q960384) (← links)
• Region-rejection based heuristics for the capacitated multi-source Weber problem (Q1000993) (← links)
• Facility placement with sub-aisle design in an existing layout (Q1011277) (← links)
• The rectilinear distance Weber problem in the presence of a probabilistic line barrier (Q1038385) (← links)
• Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm) (Q1058966) (← links)
• An efficient algorithm for facility location in the presence of forbidden regions (Q1266516) (← links)
• Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
• Reachability of locational Nash equilibria (Q1387941) (← links)
• Algebraic properties of location problems with one circular barrier. (Q1420408) (← links)
• Generalization of the restricted planar location problems: unified metaheuristic algorithms (Q1654346) (← links)
• Multicommodity flows and Benders decomposition for restricted continuous location problems (Q1754155) (← links)
• Rectilinear distance to a facility in the presence of a square barrier (Q1761830) (← links)
• Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones (Q1930700) (← links)
• Genetic algorithm for obstacle location-allocation problems with customer priorities (Q1983729) (← links)
• Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm (Q2165800) (← links)
• Conditional facility location problems with continuous demand and a polygonal barrier (Q2239930) (← links)
• The obnoxious facilities planar \(p\)-median problem (Q2241906) (← links)
• Facility location problems in the presence of two-circular forbidden regions with Euclidean distance norm. (Q2468594) (← links)
• Facility location problems in the presence of single convex/non-convex polygonal barrier/forbidden region. (Q2477119) (← links)
• Successive computation of some efficient locations of the Weber problem with barriers (Q2511354) (← links)
• Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier (Q2668733) (← links)
• Planar weber location problems with line barriers (Q2743666) (← links)
• Optimization of location of interconnected facilities on parallel lines with forbidden zones (Q5100137) (← links)
• A reduction result for location problems with polyhedral barriers (Q5937710) (← links)
• Supply facility and input/output point locations in the presence of barriers (Q5959390) (← links)