Competitive facility location model with concave demand
From MaRDI portal
Publication:877034
DOI10.1016/j.ejor.2005.10.075zbMath1131.90027OpenAlexW1982178888MaRDI QIDQ877034
Dmitry Krass, Robert Aboolian, Oded Berman
Publication date: 19 April 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.075
integer programmingworst-case boundslocationnonlinear knapsack problemgreedy heuristicsalpha-optimal solutionscompetitive facility location models
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (28)
Solving utility-maximization selection problems with multinomial logit demand: is the first-choice model a good approximation? ⋮ A variational inequality formulation for designing a multi-echelon, multi-product supply chain network in a competitive environment ⋮ Comparison of metaheuristics for the bilevel facility location and mill pricing problem ⋮ A leader-follower model for discrete competitive facility location ⋮ Competitive facility location and design problem ⋮ Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness ⋮ Competitive facility location with random attractiveness ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ Responsive make‐to‐order supply chain network design ⋮ Competitive facility location under attrition ⋮ Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution ⋮ Location Science in Canada ⋮ A refinement of the gravity model for competitive facility location ⋮ The impact of client choice on preventive healthcare facility network design ⋮ Retail location competition under carbon penalty ⋮ The minimal covering location and sizing problem in the presence of gradual cooperative coverage ⋮ A location-allocation problem for a web services provider in a competitive market ⋮ Maximizing a class of submodular utility functions with constraints ⋮ Outer approximation and submodular cuts for maximum capture facility location problems with random utilities ⋮ An approximation algorithm for a competitive facility location problem with network effects ⋮ An exact solution framework for the multiple gradual cover location problem ⋮ Maximizing a class of submodular utility functions ⋮ Optimizing facility location and design ⋮ A GIS-based optimization framework for competitive multi-facility location-routing problem ⋮ Efficient solution approaches for a discrete multi-facility competitive interaction model ⋮ Conditional Location Problems on Networks and in the Plane ⋮ Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems ⋮ On complexity of the bilevel location and pricing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for the solution of quadratic knapsack problems
- Competitive facility location and design problem
- On a discrete nonlinear and nonseparable knapsack problem
- GBSSS: The generalized big square small square method for planar single- facility location
- The nonlinear knapsack problem - algorithms and applications
- Locating multiple competitive facilities: Spatial interaction models with variable expenditures
- A nonlinear knapsack problem
- Two-Segment Separable Programming
- Computational aspects of two-segment separable programming
- Convex quadratic programming with one constraint and bounded variables
- Exact Solution of the Quadratic Knapsack Problem
This page was built for publication: Competitive facility location model with concave demand
