Pages that link to "Item:Q5937710"
From MaRDI portal
The following pages link to A reduction result for location problems with polyhedral barriers (Q5937710):
Displayed 20 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)
- On the use of the varignon frame for single facility Weber problems in the presence of convex barriers (Q439364) (← links)
- Continuous location model of a rectangular barrier facility (Q526636) (← links)
- A wavefront approach to center location problems with barriers (Q816405) (← 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)
- The multi-facility location-allocation problem with polyhedral barriers (Q960384) (← 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 cutting plane algorithm for the site layout planning problem with travel barriers (Q1652264) (← 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)
- 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)
- 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)