Discrete models for competitive location with foresight
From MaRDI portal
Publication:2456629
DOI10.1016/J.COR.2006.05.006zbMATH Open1278.90276OpenAlexW2099404039MaRDI QIDQ2456629FDOQ2456629
Authors: Frank Plastria, Lieselot Vanhaverbeke
Publication date: 19 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.05.006
Recommendations
- Integer programming formulations for three sequential discrete competitive location problems with foresight
- scientific article; zbMATH DE number 6006831
- A leader-follower model for discrete competitive facility location
- Discrete competitive facility location: modeling and optimization approaches
- Sequential discrete \(p\)-facility models for competitive location planning
Cites Work
Cited In (29)
- A bi-level stochastic optimization model for reliable supply chain in competitive environments: hybridizing exact method and genetic algorithm
- Modeling Discrete Competitive Facility Location
- Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
- Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players
- Generalized coverage: new developments in covering location models
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- A discrete competitive facility location model with proportional and binary rules sequentially applied
- A two-player competitive discrete location model with simultaneous decisions
- Aggregation without loss of optimality in competitive location models
- A Stackelberg hub arc location model for a competitive environment
- A kernel search matheuristic to solve the discrete leader-follower location problem
- 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
- A Continuous Model for Multistore Competitive Location
- A Lagrangian heuristic algorithm for a public healthcare facility location problem
- Strategic design of competing centralized supply chain networks for markets with deterministic demands
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution
- Strategic design of competing supply chain networks with foresight
- Integer programming formulations for three sequential discrete competitive location problems with foresight
- A minimax regret model for the leader-follower facility location problem
- Validating the gravity-based competitive location model using inferred attractiveness
- Multilevel decision-making: a survey
- A leader-follower game in competitive facility location
- Local search algorithms for the problem of competitive location of enterprises
- Two-player simultaneous location game: preferential rights and overbidding
- Location of retail facilities under conditions of uncertainty
- A Mathematical Programming Model with Equilibrium Constraints for Competitive Closed-Loop Supply Chain Network Design
This page was built for publication: Discrete models for competitive location with foresight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456629)