A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments


The linear ordering problem consists in finding a linear order at minimum remoteness from a weighted tournament T, the remoteness being the sum of the weights of the arcs that we must reverse in T to transform it into a linear order. This problem, also known as the search of a median order, or of a maximum acyclic subdigraph, or of a maximum consistent set… (More)
DOI: 10.1016/j.dam.2005.04.020

6 Figures and Tables


  • Presentations referencing similar topics