An exact method for the discrete \((r|p)\)-centroid problem
From MaRDI portal
Publication:887194
DOI10.1007/s10898-013-0130-6zbMath1329.90076OpenAlexW1964612312MaRDI QIDQ887194
Ekaterina Alekseeva, Aleksandr V. Plyasunov, Yury A. Kochetov
Publication date: 28 October 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0130-6
Applications of mathematical programming (90C90) Applications of game theory (91A80) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (10)
Locating facilities in a competitive environment ⋮ Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players ⋮ Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem ⋮ A kernel search matheuristic to solve the discrete leader-follower location problem ⋮ Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem ⋮ A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Discrete Competitive Facility Location: Modeling and Optimization Approaches
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sequential competitive location on networks
- Competitive facility location and design with reactions of competitors already in the market
- On the complexity of the \((r|p)\)-centroid problem in the plane
- An exact procedure and LP formulations for the leader-follower location problem
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Multiple voting location and single voting location on trees
- Multiple voting location problems
- \((r,p)\)-centroid problems on paths and trees
- Optimal location and design of a competitive facility
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- Bilevel linear programming
- VNS heuristic for the –centroid problem on the plane
- The Maximum Coverage Location Problem
- Algorithms for Voting and Competitive Location on a Network
- The Discrete Voronoi Game in a Simple Polygon
- Variable neighborhood search: Principles and applications
This page was built for publication: An exact method for the discrete \((r|p)\)-centroid problem
