A kernel search matheuristic to solve the discrete leader-follower location problem
From MaRDI portal
Publication:6195396
DOI10.1007/s11067-019-09472-7OpenAlexW2961442490WikidataQ127519822 ScholiaQ127519822MaRDI QIDQ6195396
No author found.
Publication date: 13 March 2024
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-019-09472-7
linear programmingcompetitive locationleader-follower problemkernel search\((r|p)\)-centroid\((r|X_p)\)-medianoid
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models and algorithms for competitive facility location problems with different customer behavior
- A heuristic for BILP problems: the single source capacitated facility location problem
- Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms
- Joint optimization for coordinated configuration of product families and supply chains by a leader-follower Stackelberg game
- Hub location under competition
- A Stackelberg hub arc location model for a competitive environment
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- A leader-follower model for discrete competitive facility location
- A robust model for a leader-follower competitive facility location problem in a discrete space
- Sequential competitive location on networks
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- On competition in a Stackelberg location-design model with deterministic supplier choice
- On agglomeration in competitive location models
- A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
- Some Stackelberg type location game
- An exact procedure and LP formulations for the leader-follower location problem
- The leader-follower location model
- Reaction function based dynamic location modeling in Stackelberg-Nash-Cournot competition
- An exact method for the discrete \((r|p)\)-centroid problem
- On a branch-and-bound approach for a Huff-like Stackelberg location problem
- \((r,p)\)-centroid problems on paths and trees
- Fuzzy sets as a basis for a theory of possibility
- Heuristic algorithms for the portfolio selection problem with minimum transaction lots
- All Stackelberg location equilibria in the Hotelling's duopoly model on a tree with parametric prices
- Integer programming formulations for three sequential discrete competitive location problems with foresight
- Competitive location, production, and market selection
- An alternating heuristic for medianoid and centroid problems in the plane
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
- Discrete models for competitive location with foresight
- A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks
- Leadership and Competition in Network Supply Chains
- Facility Location in Unfair Competition
- A Leader-Follower Hub Location Problem Under Fixed Markups
- Tabu Search Approach for the Bi-Level Competitive Base Station Location Problem
- Bilevel Models on the Competitive Facility Location Problem
- Leader-Follower Models in Facility Location
- Asymmetries in Competitive Location Models on the Line
- STACKELBERG HUB LOCATION PROBLEM
- A new alternating heuristic for the (r | p)–centroid problem on the plane
- Modeling Discrete Competitive Facility Location
- A matheuristic for the discrete bilevel problem with multiple objectives at the lower level
- Solving a Huff-like Stackelberg location problem on networks
- The generalized discrete ‐centroid problem
This page was built for publication: A kernel search matheuristic to solve the discrete leader-follower location problem
