Solving the competitive discretionary service facility location problem

DOI10.1016/S0377-2217(01)00391-5zbMath1012.90542MaRDI QIDQ1869391

Tai-Hsi Wu, Jen-Nan Lin

Publication date: 10 April 2003

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

zbMATH Keywords

locationcompetitive facilityflow-capturing

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (8)

A generalized model for locating facilities on a network with flow-based demand ⋮ Managerial insights from service industry models: a new scenario decomposition method ⋮ OR models in urban service facility location: a critical review of applications and future developments ⋮ Evasive flow capture: a multi-period stochastic facility location problem with independent demand ⋮ An approximation algorithm for a competitive facility location problem with network effects ⋮ Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice ⋮ Distributions of rectilinear deviation distance to visit a facility ⋮ Conditional Location Problems on Networks and in the Plane

Uses Software

• spatial

Cites Work

• Unnamed Item
• Competitive spatial models
• On locating new facilities in a competitive environment
• Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
• A note on a global approach for general 0-1 fractional programming
• Optimal Location of Discretionary Service Facilities
• Replacing continuous demand with discrete demand in a competitive location model
• Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
• Locating Discretionary Service Facilities Based on Probabilistic Customer Flows

This page was built for publication: Solving the competitive discretionary service facility location problem