Publication:4339963
From MaRDI portal
zbMath0870.90095MaRDI QIDQ4339963
Irène Charon, Olivier Hudry, Frédéric Woirgard
Publication date: 16 June 1997
Full work available at URL: http://www.numdam.org/item?id=MSH_1996__133__23_0
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
05C20: Directed graphs (digraphs), tournaments
Related Items
Maximum distance between Slater orders and Copeland orders of tournaments, An updated survey on the linear ordering problem for weighted or unweighted tournaments, On the complexity of Slater's problems, A 16-vertex tournament for which Banks set and Slater set are disjoint, The median procedure in the semilattice of orders, Bounds on the disparity and separation of tournament solutions, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, A survey on the linear ordering problem for weighted or unweighted tournaments, Unnamed Item, Unnamed Item