Computational Optimization and Applications

, Volume 51, Issue 3, pp 1297–1317

A benchmark library and a comparison of heuristic methods for the linear ordering problem


DOI: 10.1007/s10589-010-9384-9

Cite this article as:
Martí, R., Reinelt, G. & Duarte, A. Comput Optim Appl (2012) 51: 1297. doi:10.1007/s10589-010-9384-9


The linear ordering problem consists of finding an acyclic tournament in a complete weighted digraph of maximum weight. It is one of the classical NP-hard combinatorial optimization problems. This paper surveys a collection of heuristics and metaheuristic algorithms for finding near-optimal solutions and reports about extensive computational experiments with them. We also present the new benchmark library LOLIB which includes all instances previously used for this problem as well as new ones.


Metaheuristics Empirical comparison Library 

Supplementary material

10589_2010_9384_MOESM1_ESM.pdf (199 kb)
Appendix (PDF 198 KB)

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Rafael Martí
    • 1
  • Gerhard Reinelt
    • 2
  • Abraham Duarte
    • 3
  1. 1.Dept. de Estadística e Investigación OperativaUniversity of ValenciaValenciaSpain
  2. 2.Institute for Computer ScienceUniversity of HeidelbergHeidelbergGermany
  3. 3.Dept. Ciencias de la ComputaciónUniversity Rey Juan CarlosMadridSpain

Personalised recommendations