Pages that link to "Item:Q3826334"
From MaRDI portal
The following pages link to Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions (Q3826334):
Displayed 27 items.
- Dominance rules for the optimal placement of a finite-size facility in an existing layout (Q337129) (← links)
- The Weber problem in congested regions with entry and exit points (Q337649) (← links)
- Continuous location model of a rectangular barrier facility (Q526636) (← links)
- A center location problem with congestion (Q689227) (← 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)
- Contour line construction for a new rectangular facility in an existing layout with rectangular departments (Q869159) (← 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)
- Mixed planar/network facility location problems (Q1093516) (← links)
- On the accuracy of demand point solutions to the planar, Manhattan metric, p-median problem, with and without barriers to travel (Q1099772) (← links)
- A queueing-location model with expected service time dependent queueing disciplines (Q1121764) (← 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)
- Bicriteria and restricted 2-facility Weber problems (Q1362675) (← links)
- Algebraic properties of location problems with one circular barrier. (Q1420408) (← links)
- A fast algorithm for the rectilinear distance location problem (Q1616792) (← links)
- Generalization of the restricted planar location problems: unified metaheuristic algorithms (Q1654346) (← links)
- Rectilinear distance to a facility in the presence of a square barrier (Q1761830) (← links)
- Extensions to the Weber problem (Q2147049) (← links)
- Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm (Q2165800) (← links)
- The obnoxious facilities planar \(p\)-median problem (Q2241906) (← links)
- Complexity results on planar multifacility location problems with forbidden regions (Q2311127) (← links)
- Planar weber location problems with line barriers (Q2743666) (← 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)