References
- Alirezaee, M. R., & Afsharian, M. (2007). Model improvement for computational difficulties of DEA technique in the presence of special DMUs. Applied Mathematics and Computation, 186, 1600–1611.
- Aparicio, J., Ruiz, J. L., & Sirvent, I. (2007). Closest targets and minimum distance to the Pareto-efficient frontier in DEA. Journal of Productivity Analysis, 28, 209–218.
- Baek, C., & Lee, J. D. (2009). The relevance of DEA benchmarkng information data and least-distance measure. Mathematical and Computer Modelling, 49, 265–275.
- Banker, R. D., Charnes, A., & Cooper, W. W. (1984). Some models for estimating technical and scale inefficiencies in data envelopment analysis. Management Science, 30(9), 1078–1092.
- Calzada-Infante, L., & Lozano, S. (2016). Analysing olympic games through dominance networks. Physica A, 462, 1215–1230.
- Charnes, A., Cooper, W. W., Golany, B., Seiford, L., & Stutz, J. (1985). Foundations of data envelopment analysis for pareto-koopmans efficient empirical production functions. Journal of Econometrics, 30(1–2), 91–107.
- Charnes, A., Cooper, W. W., & Rhodes, E. (1978). Measuring efficiency of decision making units. European Journal of Operational Research, 2, 429–444.
- Cherchye, L., & Van Puyenbroeck, T. (2001). A comment on multi-stage dea methodology. Operations Research Letters, 28, 93–98.
- Coelli, T. (1998). A multi-stage methodology for the solution of orientated dea models. Operations Research Letters, 23, 143–149.
- Cooper, W. W., Seiford, L. M., & Tone, K. (2007). Data envelopment analysis: A comprehensive text with models, applications, references and DEA-solver software. US: Springer.
- Dehnokhalaji, A., Korhonen, P. J., Köksalan, M., Nasrabadi, N., & Wallenius, J. (2010). Efficiency analysis to incorporate interval scale data. European Journal of Operational Research, 207(2), 1116–1121.
- Estrada, S. A., Song, H. S., Kim, Y. A., Namn, S. H., & Kang, S. C. (2009). A method of stepwise benchmarking for inefficient dmus based on the proximity-based target selection. Expert Systems with Applications, 36, 11595–11604.
- Gonzalez, E., & Alvarez, A. (2001). From efficiency measurement to efficiency improvement: the choice of a relevant benchmark. European Journal of Operational Research, 133, 512–520.
- Halme, M., Joro, T., & Koivu, M. (2002). Dealing with interval-scale data in data envelopment analysis. European Journal of Operational Research, 137, 22–27.
- Jahanshahloo, G. R., Vakili, J., & Zarepisheh, M. (2012). A linear bilevel programming problem for obtaining the closest targets and minimum distance of a unit from the strong efficient frontier. Asia-Pacific Journal of Operational Research, 29(2), 1–19. Article ID 1250011
- Joro, T., Korhonen, P. J., & Wallenius, J. (1998). Structural Comparison of data envelopment analysis and multiple objective linear programming. Management Science, 44, 962–970.
- Lim, S., Bae, H., & Lee, L. H. (2011). A study on the selection of benchmarking paths in DEA. Expert Systems with Applications, 38, 7665–7673.
- Lozano, S. & Calzada-Infante, L. (2017a). Dominance network analysis of economic efficiency. Expert Systems with Applications, 82, 53–66.
- Lozano, S.b, & Calzada-Infante, L. (2017b). Computing gradient-based stepwise benchmarking paths. Omega. doi:10.1016/j.omega.2017.11.002.
- Lozano, S., & Villa, G. (2005). Determining a sequence of targets in DEA. Journal of Operational Research Society, 56, 1439–1447.
- Park, J. H., Bae, H. R., & Lim, S. M. (2010). Method of benchmarking route choice based on the input-similarity using DEA and SOM. Journal of the Korean Institute of Industrial Engineers, 36, 32–41.
- Park, J. H., Bae, H. R., & Lim, S. M. (2012). A dea-based method of stepwise benchmark target selection with preference, direction and similarity criteria. International Journal of Innovative Computing, Information and Control, 8, 5821–5834.
- Portela, M. C. A. S., Borges, P. C., & Thanassoulis, E. (2003). Finding closest targets in non-oriented DEA models: the case of convex and non-convex technologies. Journal of Productivity Analysis, 19, 251–269.