An approximation algorithm for a competitive facility location problem with network effects
From MaRDI portal
Publication:1754226
DOI10.1016/j.ejor.2017.11.037zbMath1403.90479OpenAlexW2775721008MaRDI QIDQ1754226
Ling-Chieh Kung, Wei-Hung Liao
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.11.037
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (6)
Optimization of facility location and size problem based on bi-level multi-objective programming ⋮ Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem ⋮ Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors ⋮ A minimax regret model for the leader-follower facility location problem ⋮ Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets ⋮ Submodularity and local search approaches for maximum capture problems under generalized extreme value models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the competitive facility location problem with a free choice of suppliers
- Randomized local search for the discrete competitive facility location problem
- Maximizing a class of submodular utility functions
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
- Competitive facility location model with concave demand
- Competitive facility location and design problem
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- Approximation algorithms for knapsack problems with cardinality constraints
- A leader-follower game in competitive facility location
- Strategic facility location: A review
- Approximately global optimization for assortment problems using piecewise linearization techniques
- Solving the competitive discretionary service facility location problem
- Locating multiple competitive facilities: Spatial interaction models with variable expenditures
- Network and Discrete Location: Models, Algorithms, and Applications, Second Edition
- The Design of Approximation Algorithms
- Maximizing Non-monotone Submodular Functions
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Modeling Discrete Competitive Facility Location
This page was built for publication: An approximation algorithm for a competitive facility location problem with network effects
