Additional constraints for dynamic competitive facility location problem

DOI10.33048/DAIO.2023.30.774MaRDI QIDQ6644068zbMATH OpenFDO

Authors V. L. Beresnev, Andrey Melnikov

Publication date 27 November 2024

Published in Diskretnyĭ Analiz i Issledovanie Operatsiĭ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/DAIO.2023.30.774

zbMATH Keywords

bi-level programmingcompetitive locationStackelberg gamevalid inequalities

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Nonlinear programming (90C30) Spatial models in economics (91B72)

Recommendations

• scientific article; zbMATH DE number 6006831
• Approximation of the competitive facility location problem with MIPs
• scientific article; zbMATH DE number 7656027
• Exact method for the capacitated competitive facility location problem
• Upper bounds for goal functions of discrete competitive facility location problems

Cites work

• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
• A robust model for a leader-follower competitive facility location problem in a discrete space
• Approximation of the competitive facility location problem with MIPs
• Bilevel models on the competitive facility location problem
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
• Modeling Discrete Competitive Facility Location
• On the competitive facility location problem with a free choice of suppliers
• Sequential competitive location on networks
• The leader-follower location model

Cited in

(1)

• A branch, bound, and cuts algorithm for the dynamic competitive facility location problem

This page was built for publication: Additional constraints for dynamic competitive facility location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644068)