The Weber Location Problem: The Threshold Objective
From MaRDI portal
Recommendations
Cites work
- A general global optimization approach for solving location problems in the plane
- A stochastic gradual cover location problem
- A Stochastic Programming Model
- Asymptotic behavior of the Weber location problem on the plane
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 3014822 (Why is no real title available?)
- Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
- Locating a service facility with some unserviced demand
- Location Theory, Dominance, and Convexity
- Optimum Locations on a Graph with Probabilistic Demands
- Probabilistic Weights in the One-Dimensional Facility Location Problem
- The 1-Median And 1-Antimedian Problems With Continuous Probabilistic Demand Weights
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Weber Problem On The Plane With Some Negative Weights
- Two algorithms for constructing a Delaunay triangulation
Cited in
(4)
This page was built for publication: The Weber Location Problem: The Threshold Objective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102732)