Pages that link to "Item:Q960384"
From MaRDI portal
The following pages link to The multi-facility location-allocation problem with polyhedral barriers (Q960384):
Displaying 11 items.
- A projected Weiszfeld algorithm for the box-constrained Weber location problem (Q425491) (← 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 cutting plane algorithm for the site layout planning problem with travel barriers (Q1652264) (← 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)
- Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm (Q2165800) (← links)
- Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem (Q2358289) (← 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)
- AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS (Q2929639) (← links)
