The Maximum Capture Problem Including Relocation

DOI10.1080/03155986.1991.11732161zbMath0732.90051OpenAlexW115225932MaRDI QIDQ3359990

Daniel Serra, Charles S. Re Velle

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

market shareRelocationfacility siting in a competitive environmentmaximize market population from competitors

Mathematics Subject Classification ID

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

Related Items (5)

Customer allocation in maximum capture problems ⋮ Cournot-Stackelberg games in competitive delocation ⋮ On agglomeration in competitive location models ⋮ The maximum-capture hierarchical location problem ⋮ Sequential location problems

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