Approximation of the competitive facility location problem with MIPs

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	139-148
Number of pages	10
Journal	Computers and Operations Research
Volume	104
DOIs	https://doi.org/10.1016/j.cor.2018.12.010
Publication status	Published - 1 Apr 2019

Bi-level programming, Branch-and-bound., Cut generation, Location, Stackelberg game, Branch-and-bound, CHOICE

ID: 18068646