Pages that link to "Item:Q5322073"
From MaRDI portal
The following pages link to On the Continuous Fermat-Weber Problem (Q5322073):
Displaying 28 items.
- A generalized Weber problem with different gauges for different regions (Q278331) (← links)
- A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand (Q342327) (← links)
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
- On vehicle placement to intercept moving targets (Q644281) (← 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)
- Minimum-cost load-balancing partitions (Q834581) (← links)
- An efficient solution method for Weber problems with barriers based on genetic algorithms (Q856193) (← links)
- The projection median of a set of points (Q1025289) (← links)
- On the geometric median of convex, triangular and other polygonal domains (Q1717123) (← links)
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747) (← links)
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams (Q2030244) (← links)
- A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
- Continuous facility location on graphs (Q2118124) (← links)
- Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case (Q2216178) (← links)
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game (Q2232238) (← links)
- Conditional facility location problems with continuous demand and a polygonal barrier (Q2239930) (← links)
- On the Weber facility location problem with limited distances and side constraints (Q2448124) (← links)
- Weber problems with mixed distances and regional demand (Q2465384) (← links)
- On the Fermat-Weber point of a polygonal chain and its generalizations (Q2895768) (← links)
- An Approximation Algorithm for the Continuous <i>k</i>-Medians Problem in a Convex Polygon (Q2962556) (← links)
- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance (Q3183457) (← links)
- Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand (Q3453339) (← links)
- (Q4969141) (← links)
- Continuous Facility Location on Graphs (Q5041743) (← links)
- Continuous approximation formulas for location problems (Q6085881) (← links)
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game (Q6099392) (← links)
- (Q6156664) (← links)