2026-10-14T18:26:10Z https://data.mendeley.com/oai

oai:data.mendeley.com/vhst7gvh7j.1 2018-08-01T11:40:08Z

Klose, Andreas CFLP-Instance-Generator Mendeley Data C-code for generating test problem instances for the Capacitated Facility Location Problem according to a proposal made by Cornuejols et al. (1991). The test instances where used in Klose and Goertz (2007) and Goertz and Klose (2012). References: Cornuejols G, Sridharan R, Thizy J-M (1991) A Comparison of Heuristics and Relaxations for the Capacitated Plant Location Problem. Eur J Oper Res 50:280-297. doi: 10.1016/0377-2217(91)90261-S Klose A, Goertz S (2007) A branch-and-price algorithm for the capacitated facility location problem. Eur J Oper Res 179:1109-1125. doi: 10.1016/j.ejor.2005.03.078 Goertz S, Klose A (2012) A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem. INFORMS J Computing 24:597-610. doi: 10.1287/ijoc.1110.0468 Operations Research Nonlinear Programming Mixed Integer Programming Facility Location Dataset doi:10.17632/vhst7gvh7j.1 oai:data.mendeley.com/vhst7gvh7j.1 Creative Commons Attribution 4.0 International http://creativecommons.org/licenses/by/4.0 https://data.mendeley.com/datasets/vhst7gvh7j 2018-08-01T11:40:08Z