Locating multiple competitive facilities: Spatial interaction models with variable expenditures

DOI10.1023/A:1020957904442zbMath1013.90086MaRDI QIDQ1872035

Oded Berman, Dmitry Krass

Publication date: 4 May 2003

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

zbMATH Keywords

integer programmingworst-case boundsgreedy heuristicscompetitive facility location models

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (29)

Constrained location of competitive facilities in the plane ⋮ A leader-follower model for discrete competitive facility location ⋮ A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand ⋮ A Lagrangian heuristic algorithm for a public healthcare facility location problem ⋮ Competitive facility location model with concave demand ⋮ A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand ⋮ Competitive facility location and design problem ⋮ Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness ⋮ The leader-follower location model ⋮ A generalized model for locating facilities on a network with flow-based demand ⋮ Location and design decisions of facilities in a distribution system with elastic customer demand ⋮ Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution ⋮ Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem ⋮ Modelling beneficiaries' choice in disaster relief logistics ⋮ The impact of client choice on preventive healthcare facility network design ⋮ GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM ⋮ Siting and sizing of facilities under probabilistic demands ⋮ An approach for solving competitive location problems with variable demand using multicore systems ⋮ Siting and sizing of facilities under probabilistic demands ⋮ GASUB: finding global optima to discrete location problems by a genetic-like algorithm ⋮ Profit maximization and reduction of the cannibalization effect in chain expansion ⋮ An approximation algorithm for a competitive facility location problem with network effects ⋮ Insights into clients' choice in preventive health care facility location planning ⋮ On competitive sequential location in a network with a decreasing demand intensity ⋮ Optimizing facility location and design ⋮ A GIS-based optimization framework for competitive multi-facility location-routing problem ⋮ On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems ⋮ Big segment small segment global optimization algorithm on networks ⋮ Conditional Location Problems on Networks and in the Plane

This page was built for publication: Locating multiple competitive facilities: Spatial interaction models with variable expenditures