References
- Anderson, P.E., Chartier, T.P., Langville, A.N., & Pedings-Behling, K.E. (2022). Fairness and the set of optimal rankings for the linear ordering problem. Optimization and Engineering 23, 1289–1317.
https://doi.org/10.1007/s11081-021-09650-y - Baioletti, M., Milani, A., & Santucci, V. (2015). Linear ordering optimization with a combinatorial differential evolution. In IEEE International Conference on Systems, Man, and Cybernetics (pp. 2135–2140). Hong Kong.
https://doi.org/10.1109/SMC.2015.373 - Ceberio, J., Mendiburu, A., & Lozano, J.A. (2015). The linear ordering problem revisited. European Journal of Operational Research 241, 686–696.
https://doi.org/10.1016/j.ejor.2014.09.041 - Chartier, T.P., Kreutzer, E., Langville, A.N., Pedings, K., & Yamamoto, Y. (2010). Minimum violations sports ranking using evolutionary optimization and binary integer linear program approaches. In A. Bedford & M. Ovens (eds.), Proceedings of the Tenth Australian Conference on Mathematics and Computers in Sport (pp. 13–20). New South Wales, Australia.
https://www.academia.edu/75423491/Minimum_Violations_Sports_Ranking_Using_Evolutionary_Optimization_and_Binary_Integer_Linear_Program_Approaches#outer_page_7 - Coleman, B.J. (2005). Minimizing game score violations in college football rankings. Interfaces 35(6), 483–496.
https://doi.org/10.1287/inte.1050.0172 - Coleman, B.J. (2014). Minimum violations and predictive meta-rankings for college football. Naval Research Logistics 61(1), 17–33.
https://doi.org/10.1002/nav.21563 - Dupin, N. (2022). Integer linear programming reformulations for the linear ordering problem. HAL open science. hal-03607145,
https://hal.science/hal-03607145v1/document - Garey, M.R., & Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman & Co.
https://perso.limos.fr/~palafour/PAPERS/PDF/Garey-Johnson79.pdf - Grötschel, M., Jünger, M., & Reinelt, G. (1984). A cutting plane algorithm for the linear ordering problem. Operations Research 32(6), 1195–1220,
https://doi.org/10.1287/opre.32.6.1195 - Lugo, L., Segura, C., & Miranda, G. (2022). A diversity-aware memetic algorithm for the linear ordering problem. Memetic Computing 14, 395–409,
https://doi.org/10.1007/s12293-022-00378-5 - Martí, R. (2010). lolib_2010. Retrieved August 27, 2024, from
https://www.dropbox.com/s/fk105g63jmi3i1d/lolib_2010.zip?dl=0 - Martí, R., Reinelt, G., & Duarte, A. (2012). A benchmark library and a comparison of heuristic methods for the linear ordering problem. Computational Optimization and Applications 51, 1297–1317,
https://doi.org/10.1007/s10589-010-9384-9 - Massey, K. (2024) Massey ratings - scores and schedule data archive. Retrieved August 27, 2024, from
https://masseyratings.com/data - Massey, K. (2025a) Massey ratings – college baseball rankings. Retrieved July 1, 2025, from
https://masseyratings.com/ranks?s=cbase&top=-1 - Massey, K. (2025b) Massey ratings – college basketball rankings. Retrieved July 1, 2025, from
https://masseyratings.com/ranks?s=cb&top=-1 - Massey, K. (2025c) Massey ratings – college football rankings. Retrieved July 1, 2025, from
https://masseyratings.com/ranks?s=cf&d=20250121&top=-1 - Miles, W.W., Fowks, G.T., & Coulter, L.O. (2010). AccuV college football ranking model. Journal of Quantitative Analysis in Sports 6(3),
https://doi.org/10.2202/1559-0410.1189 - Miller, C., Tucker, A., & Zemlin, R (1960). Integer programming formulation of traveling salesman problems, Journal of the ACM 7(4), 326–329,
https://doi.org/10.1145/321043.321046 - Pedings, K.E., Langville, A.N., & Yamamoto, Y.A. (2012). A minimum violations ranking method. Optimization and Engineering 13, 349–370,
https://doi.org/10.1007/s11081-011-9135-5 - Santucci, V., & Ceberio, J. (2020). Using pairwise precedences for solving the linear ordering problem, Applied Soft Computing 87.
https://doi.org/10.1016/j.asoc.2019.105998 - Schiavinotto, T., & Stützle, T. (2004). The linear ordering problem: instances, search space analysis and algorithms. Journal of Mathematical Modeling and Algorithms 3, 367–402.
https://doi.org/10.1023/B:JMMA.0000049426.06305.d8