@conference {Abbal2022,
	title = {Multi-level multi-capacitated facility location problem: formulation and resolution.},
	booktitle = {2022 IEEE 6th International Conference on Logistics Operations Management, GOL 2022},
	year = {2022},
	note = {cited By 0},
	abstract = {Facility location problem is one of the most problems studied since the 1950 years; many variants have been introduced in order to deal with real-world problems. In 2016, a new variant was developed to generalize the p-median problem, called {\textquoteright}budget constraint multi-capacitated location problem{\textquoteright} (BMCLP). This paper aims to generalize the BMCLP onto the multi-level, a problem that arises in many scopes as telecommunication, freight transportation, etc. Therefore, we proposed a mathematical formulation as mixed integer, called {\textquoteright}Multi-level multi-capacitated facility location problem{\textquoteright} (MLMCLP) and generated an artificial set of instances in order to validate the new formulation. Finally, we apply the Branch and Cut solving method using the CPLEX solver. The results obtained from the numerical study show the robustness of the proposed formulation. {\textcopyright} 2022 IEEE.},
	keywords = {Branch Cuts, Budget constraint, Budget control, Capacitated facility location problems, Capacitated location, Facilities locations, Freight transportation, Generalisation, Integer programming, Location, Location problems, Multi-capacity, Multilevels, Problem formulation},
	doi = {10.1109/GOL53975.2022.9820242},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135206286\&doi=10.1109\%2fGOL53975.2022.9820242\&partnerID=40\&md5=d5a9b0d02e9e1d7bfa52d2971ac50263},
	author = {Abbal, K. and El Amrani, M. and Benadada, Y.}
}
@conference {Abbal2020,
	title = {Bi-level multi-capacitated facility location problem},
	booktitle = {Proceedings - 2020 5th International Conference on Logistics Operations Management, GOL 2020},
	year = {2020},
	note = {cited By 1},
	abstract = {Facility location problems can be considered as a century-old science. Studies on this subject began in the 1950s and are still relevant today. In 2016, a new variant of the location problems, called {\textquoteright}budget constraint multi-capacitated location problem{\textquoteright} (BMCLP), is published to generalize the p-median one. In this work, we propose a generalization of the BMCLP into a bilevel location problem (plants-depots and depots-customers) in order to consider, the modern supply chain constraints. We therefore established a mathematical formulation for the new problem, named {\textquoteright}bi-level multi-capacitated facility location problem{\textquoteright} and we created data instances adapted to this new formulation based on semi-random factors and certain generation methods available in the literature. In order to validate the latter formulation, we proposed Branch Cut solving method used by CPLEX solver. Finally, we present the obtained computational results, which prove the efficiency of the new formulation for the tested instances. {\textcopyright} 2020 IEEE.},
	keywords = {Budget constraint, Budget control, Capacitated facility location problems, Capacitated location, Computational results, Facility location problem, Generation method, Location, Location problems, Mathematical formulation, Supply chains},
	doi = {10.1109/GOL49479.2020.9314710},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100167979\&doi=10.1109\%2fGOL49479.2020.9314710\&partnerID=40\&md5=2a6d370ea7da84d66da95771f24a1900},
	author = {Abbal, K. and Benadada, Y. and Mohammed, E.A.}
}
