Replacing continuous demand with discrete demand in a competitive location model
From MaRDI portal
Publication:4346868
DOI10.1002/(SICI)1520-6750(199702)44:1%3C81::AID-NAV5%3E3.0.CO;2-IzbMATH Open0882.90083OpenAlexW2091454450MaRDI QIDQ4346868FDOQ4346868
Authors: Tammy Drezner, Zvi Drezner 
Publication date: 5 August 1997
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199702)44:1%3C81::aid-nav5%3E3.0.co;2-i
Recommendations
- A continuous analysis framework for the solution of location-allocation problems with dense demand
- Discrete competitive facility location: modeling and optimization approaches
- Comparative error bound theory for three location models: continuous demand versus discrete demand
- Allocation of discrete demand with changing costs
- Aggregation without loss of optimality in competitive location models
Cited In (26)
- Constrained location of competitive facilities in the plane
- Solving the competitive discretionary service facility location problem
- Formulation of confidence intervals for estimated actual distances
- Competitive location models: a review
- The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane
- On the convergence of the generalized Weiszfeld algorithm
- Multipurpose shopping trips and location
- On the overlap area of a disk and a piecewise circular domain
- A comparison continuous approximation with mathematical programming approach to location problems
- Competitive facility location with random attractiveness
- The gravity multiple server location problem
- Comparative error bound theory for three location models: continuous demand versus discrete demand
- Spatial uncertainty in harvest scheduling
- The gravity \(p\)-median model
- Some personal views on the current state and the future of locational analysis
- Location and layout planning. A survey
- A directional approach to gradual cover
- Solving the multiple competitive facilities location problem
- Aggregation error for location models: Survey and analysis
- Locating facilities by minimax relative to closest points of demand areas
- A continuous analysis framework for the solution of location-allocation problems with dense demand
- Efficient solution approaches for a discrete multi-facility competitive interaction model
- On a branch-and-bound approach for a Huff-like Stackelberg location problem
- Competitive facility location under attrition
- Location of retail facilities under conditions of uncertainty
- Big segment small segment global optimization algorithm on networks
This page was built for publication: Replacing continuous demand with discrete demand in a competitive location model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4346868)
