An Always-Convergent Numerical Scheme for a Random Locational Equilibrium Problem
From MaRDI portal
Cited in
(12)- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
- Solving probabilistic multi-facility Weber problem by vector quantization
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
- Optimal location on a sphere
- Normative location theory: Placement in continuous space
- The stochastic transportation-location problem
- Integer linear programming models for grid-based light post location problem
- A 1-center problem on the plane with uniformly distributed demand points
- Weber's problem and weiszfeld's algorithm in general spaces
- Local convergence in Fermat's problem
- A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations
- Location models with stochastic demand points
This page was built for publication: An Always-Convergent Numerical Scheme for a Random Locational Equilibrium Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4776692)