Discrete models for competitive location with foresight
From MaRDI portal
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
(31)- A bi-level stochastic optimization model for reliable supply chain in competitive environments: hybridizing exact method and genetic algorithm
- Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution
- Modeling Discrete Competitive Facility Location
- 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
- A mathematical programming model with equilibrium constraints for competitive closed-loop supply chain network design
- 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
- Discrete competitive facility location: modeling and optimization approaches
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- A kernel search matheuristic to solve the discrete leader-follower location problem
- 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 Lagrangian heuristic algorithm for a public healthcare facility location problem
- Strategic design of competing centralized supply chain networks for markets with deterministic demands
- A Continuous Model for Multistore Competitive Location
- Strategic design of competing supply chain networks with foresight
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution
- 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
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Competitive facility location under attrition
- A leader-follower game in competitive facility location
- Local search algorithms for the problem of competitive location of enterprises
- Location of retail facilities under conditions of uncertainty
- Two-player simultaneous location game: preferential rights and overbidding
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)
