Aggregation without loss of optimality in competitive location models

DOI10.1007/S11067-006-9004-5zbMath1137.91337OpenAlexW2044735927MaRDI QIDQ883193

Lieselot Vanhaverbeke, Frank Plastria

Publication date: 31 May 2007

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-006-9004-5

zbMATH Keywords

Consumer behaviourCompetitive locationDemand point aggregationvon Stackelberg model

Mathematics Subject Classification ID

Hierarchical games (including Stackelberg games) (91A65) Discrete location and assignment (90B80) Consumer behavior, demand theory (91B42)

Related Items (7)

Competitive location and pricing on networks with random utilities ⋮ Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms ⋮ Demand point aggregation method for covering problems with gradual coverage ⋮ A note on maximal covering location games ⋮ Location-allocation models for traffic police patrol vehicles on an interurban network ⋮ Maximal covering location problem with price decision for revenue maximization in a competitive environment ⋮ Equilibria in Competitive Location Models

Uses Software

• AMPL
• CPLEX

Cites Work

• Unnamed Item
• Bilevel programming: a survey
• Formulating logical implications in combinatorial optimisation
• Discrete models for competitive location with foresight
• Static competitive facility location: an overview of optimisation approaches.

This page was built for publication: Aggregation without loss of optimality in competitive location models