The Maximum Capture Problem Including Relocation

DOI10.1080/03155986.1991.11732161MaRDI QIDQ3359990zbMATH OpenOpenAlexFDO

Authors Daniel Serra, C. S. Revelle

Publication date 1991

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1991.11732161

zbMATH Keywords

facility siting in a competitive environmentmarket sharemaximize market population from competitorsRelocation

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Marketing, advertising (90B60) Discrete location and assignment (90B80) Boolean programming (90C09) Integer programming (90C10) Applications of mathematical programming (90C90)

Recommendations

• The maximum capture problem with random utilities: problem formulation and algorithms
• Optimal location and design of a competitive facility
• Determining the location and capacity of competitive facilities
• The maximum capture problem with heterogeneous customers
• A capacitated competitive facility location problem

Cited in

(8)

• The maximum-capture hierarchical location problem
• Sequential location problems
• An optimal hostage rescue problem.
• A new chance-constrained maximum capture location problem
• Cournot-Stackelberg games in competitive delocation
• Customer allocation in maximum capture problems
• On agglomeration in competitive location models
• Relocation-promotion problem with Euclidean distance

This page was built for publication: The Maximum Capture Problem Including Relocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3359990)