The presented paper at IISE-2019 is now available here on Optimization Online. In this paper, we have developed a branch-and-bound algorithm for the capacitated competitive facility location problem. However, it has a general framework and can be used for any mixed-integer bi-level model. Solving these problems when the lower level is a mixed-integer model is challenging.