A survey on the linear ordering problem for weighted or unweighted tournaments
- 17 March 2007
- journal article
- invited survey
- Published by Springer Nature in 4OR
- Vol. 5 (1), 5-60
- https://doi.org/10.1007/s10288-007-0036-6
Abstract
No abstract availableKeywords
This publication has 145 references indexed in Scilit:
- Facets of the linear ordering polytope: A unification for the fence family through weighted graphsJournal of Mathematical Psychology, 2006
- Parameterized algorithms for feedback set problems and their duals in tournamentsTheoretical Computer Science, 2006
- NoteDiscrete Applied Mathematics, 1997
- Packing directed circuits fractionallyCombinatorica, 1995
- Random Utility Representation of Binary Choice Probabilities: Critical Graphs Yielding Critical Necessary ConditionsJournal of Mathematical Psychology, 1995
- Approximations for the maximum acyclic subgraph problemInformation Processing Letters, 1994
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case boundDiscrete Mathematics, 1986
- The median procedure in cluster analysis and social choice theoryMathematical Social Sciences, 1981
- On the maximal order of cyclicity of antisymmetric directed graphsDiscrete Mathematics, 1975