New results on the computation of median orders
Authors:
- 15 March 1997
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 165-166, 139-153
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The reversing number of a diagraphDiscrete Applied Mathematics, 1995
- Selecting varieties using a series of trials and a combinatorial ordering methodAgronomy for Sustainable Development, 1994
- Covering relations, closest orderings and hamiltonian bypaths in tournamentsSocial Choice and Welfare, 1991
- Median linear orders: Heuristics and a branch and bound algorithmEuropean Journal of Operational Research, 1989
- Polyhedral combinatorics and the acyclic subdigraph problem: M. Junger, Berlin: Heldermann Verlag, 1985, 128 pages, $36.00.Mathematical Social Sciences, 1986
- The median procedure in cluster analysis and social choice theoryMathematical Social Sciences, 1981
- SERIATION USING ASYMMETRIC PROXIMITY MEASURESBritish Journal of Mathematical and Statistical Psychology, 1976
- Graphs with forbidden subgraphsJournal of Combinatorial Theory, Series B, 1971
- Maximum-likelihood paired comparison rankingsBiometrika, 1966
- Inconsistencies in a schedule of paired comparisonsBiometrika, 1961