Integer programming formulations for three sequential discrete competitive location problems with foresight-Reference-Cited by-同舟云学术

Integer programming formulations for three sequential discrete competitive location problems with foresight

Published:2018-03 Issue:3 Volume:265 Page:872-881
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Gentile José,Alves Pessoa Artur,Poss Michael,Costa Roboredo Marcos^ORCID

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference23 articles.

1. An algorithm for the discrete bilevel programming problem;Bard;NavalResearchLogistics(NRL),1992

2. Robust optimization;Ben-Tal,2009

3. The maximal covering location problem;Church;Papers in Regional Science,1974

4. Network and discrete location: Models, algorithms, and applications;Daskin,2011

5. Competitive spatial models;Eiselt;European Journal of Operational Research,1989

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A location and capacity-allocation game model for two competing online delivery platforms seeking new customers;Electronic Commerce Research;2024-08-19

2. Facility Location and Discrete Pricing under Random Utilities;SSRN Electronic Journal;2024

3. A comparative performance analysis of intelligence-based algorithms for optimizing competitive facility location problems;Machine Learning with Applications;2023-03

4. Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: Model and solution;Computers & Operations Research;2022-10

5. Omnichannel facility location and fulfillment optimization;Transportation Research Part B: Methodological;2022-09