Tournament Ranking with Expected Profit in Polynomial Time
- 1 August 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 1 (3) , 372-376
- https://doi.org/10.1137/0401037
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- On the Minimum Violations Ranking of a TournamentManagement Science, 1986
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case boundDiscrete Mathematics, 1986
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- On the maximum cardinality of a consistent set of arcs in a random tournamentJournal of Combinatorial Theory, Series B, 1983
- Optimal ranking of tournamentsNetworks, 1971