Integer programming formulations for three sequential discrete competitive location problems with foresight

DOI10.1016/j.ejor.2017.08.041zbMath1374.90273OpenAlexW2754999615MaRDI QIDQ1681140

Michael Poss, Marcos Costa Roboredo, Artur Alves Pessoa, José Gentile

Publication date: 23 November 2017

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01653290/file/2016_PC_MA_ST_Gentile_Pessoa_Roboredo_Poss_v4.pdf

zbMATH Keywords

integer programmingcombinatorial optimizationStackelberg problemcompetitive locationmaximal covering location problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Production theory, theory of the firm (91B38) Discrete location and assignment (90B80) Spatial models in economics (91B72)

Related Items (10)

Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ A kernel search matheuristic to solve the discrete leader-follower location problem ⋮ Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors ⋮ Sequential Location Game on Continuous Directional Star Networks ⋮ Effects of multipurpose shopping trips on retail store location in a duopoly ⋮ Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule ⋮ Competitive location and pricing on a line with metric transportation costs ⋮ Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem ⋮ A minimax regret model for the leader-follower facility location problem

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Sequential competitive location on networks
• Designing robust coverage networks to hedge against worst-case facility losses
• Multiple voting location and single voting location on trees
• Cutting plane algorithms for solving a stochastic edge-partition problem
• Competitive spatial models
• On locating new facilities in a competitive environment
• Sequential location problems
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• Discrete models for competitive location with foresight
• Intersection Cuts for Bilevel Optimization
• Shortest-path network interdiction
• The Mixed Integer Linear Bilevel Programming Problem
• Competitive Location Models: A Framework and Bibliography
• Bilevel programming and price setting problems

This page was built for publication: Integer programming formulations for three sequential discrete competitive location problems with foresight