Analyzing location models by the maximum possible value of perfect information
From MaRDI portal
Cites work
- A refinement of the gravity model for competitive facility location
- An approximation algorithm for the continuous k-medians problem in a convex polygon
- An exact and a heuristic approach for the transportation-\(p\)-facility location problem
- Competitive facility location under attrition
- Competitive location models: a review
- Complexity results for the \(p\)-median problem with mutual communication
- Derived attractiveness of shopping malls
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- EVPI-based importance sampling solution procedures for multistage stochastic linear programmes on parallel MIMD architectures
- Extensions to competitive facility location with multi-purpose trips
- Extensions to the planar \(p\)-median problem
- Finding the optimal solution to the Huff based competitive location model
- Location Theory, Dominance, and Convexity
- Multi-facility location models incorporating multipurpose shopping trips
- Multipurpose shopping trips and location
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
- On-line production control using the EVPI approach
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Some Aspects of the Distributional Properties of the Expected Value of Perfect Information (EVPI)
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Value of Information and Stochastic Programming
- The value of the stochastic solution in multistage problems
This page was built for publication: Analyzing location models by the maximum possible value of perfect information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7250678)
