The following pages link to (Q4788111):
Displaying 27 items.
- Solving Weber problem on plane with minimax criterion and forbidden gaps (Q278537) (← links)
- 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)
- 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)
- Contour line construction for a new rectangular facility in an existing layout with rectangular departments (Q869159) (← 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)
- 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)
- Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance (Q1789630) (← links)
- Prediction-correction alternating direction method for a class of constrained min-max problems (Q1956529) (← links)
- Planar multifacility location problems with tree structure and finite dominating sets (Q2010913) (← links)
- Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm (Q2165800) (← links)
- Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances (Q2192465) (← links)
- Complexity results on planar multifacility location problems with forbidden regions (Q2311127) (← links)
- A unified model for Weber problems with continuous and network distances (Q2384880) (← links)
- Successive computation of some efficient locations of the Weber problem with barriers (Q2511354) (← links)
- Location-based techniques for the synergy approximation in combinatorial transportation auctions (Q2629915) (← links)
- Construction Line Algorithms for the Connection Location-Allocation Problem (Q5391943) (← links)
- Location Problems with Cutoff (Q6053539) (← links)
- Solving net-constrained clustering problem (Q6668165) (← links)
