Pages that link to "Item:Q3790916"
From MaRDI portal
The following pages link to Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons (Q3790916):
Displaying 13 items.
- Estimating demand with distance functions: parameterization in the primal and dual (Q299466) (← links)
- Heuristics for a continuous multi-facility location problem with demand regions (Q337660) (← links)
- A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand (Q342327) (← links)
- The geometry of optimal partitions in location problems (Q683940) (← links)
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand (Q709182) (← links)
- A continuous analysis framework for the solution of location-allocation problems with dense demand (Q733530) (← links)
- Kohonen maps for solving a class of location-allocation problems (Q1296007) (← links)
- A continuous approximation approach for the integrated facility-inventory allocation problem (Q1926929) (← links)
- Conditional facility location problems with continuous demand and a polygonal barrier (Q2239930) (← links)
- A minisum location problem with regional demand considering farthest Euclidean distances (Q2815539) (← links)
- Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand (Q3453339) (← links)
- A squared-euclidean distance location-allocation problem (Q4005859) (← links)
- Optimal location of a single facility with circular demand areas (Q5948771) (← links)
