Approximation of the competitive facility location problem with MIPs

Title
Approximation of the competitive facility location problem with MIPs
Authors
Keywords
Location, Stackelberg game, Bi-level programming, Cut generation, Branch-and-bound.
Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 104, Issue -, Pages 139-148
Publisher
Elsevier BV
Online
2018-12-15
DOI
10.1016/j.cor.2018.12.010

Ask authors/readers for more resources

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now