Pages that link to "Item:Q4291466"

The following pages link to Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel (Q4291466):

Displaying 37 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)
• Continuous location model of a rectangular barrier facility (Q526636) (← links)
• A continuous location-allocation problem with zone-dependent fixed cost (Q816411) (← 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)
• 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)
• 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)
• Restricted center problems under polyhedral gauges (Q1291660) (← links)
• Bicriteria and restricted 2-facility Weber problems (Q1362675) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• A maximum \(L_p\) distance problem (Q1378646) (← links)
• Algebraic properties of location problems with one circular barrier. (Q1420408) (← links)
• The Weber obnoxious facility location model: a big arc small arc approach (Q1651661) (← 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)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Genetic algorithm for obstacle location-allocation problems with customer priorities (Q1983729) (← links)
• Extensions to the Weber problem (Q2147049) (← links)
• Conditional facility location problems with continuous demand and a polygonal barrier (Q2239930) (← links)
• The obnoxious facilities planar \(p\)-median problem (Q2241906) (← links)
• Complexity results on planar multifacility location problems with forbidden regions (Q2311127) (← 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 the norm of a vector-valued DC function and applications (Q5925721) (← links)
• A reduction result for location problems with polyhedral barriers (Q5937710) (← links)
• Error bounds for the approximative solution of restricted planar location problems (Q5954828) (← links)
• Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)