Sequential discrete \(p\)-facility models for competitive location planning

DOI10.1023/A:1020914122189zbMath1013.90082OpenAlexW1578304747MaRDI QIDQ1872039

Kathrin Fischer

Publication date: 4 May 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020914122189

zbMATH Keywords

oligopolycompetitive locationspatial price discriminationdiscrete location models

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Discrete location and assignment (90B80)

Related Items (12)

Locating facilities in a competitive environment ⋮ Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution ⋮ Structure of demand and consistent conjectural variations equilibrium (CCVE) in a mixed oligopoly model ⋮ A decision support model for staff allocation of mobile medical service ⋮ Strategic design of competing supply chain networks with foresight ⋮ A leader-follower game in competitive facility location ⋮ Parametric integer programming algorithm for bilevel mixed integer programs ⋮ Competitive location and pricing on a line with metric transportation costs ⋮ The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem ⋮ A minimax regret model for the leader-follower facility location problem ⋮ A double VNS heuristic for the facility location and pricing problem ⋮ Conditional Location Problems on Networks and in the Plane

This page was built for publication: Sequential discrete \(p\)-facility models for competitive location planning