Maximum likelihood paired comparison ranking by linear programming
From MaRDI portal
Publication:5582743
DOI10.1093/biomet/56.3.537zbMath0188.50101OpenAlexW1997532908MaRDI QIDQ5582743
Publication date: 1969
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/biomet/56.3.537
Related Items
A note on small linear-ordering polytopes, Disentangling relationships in symptom networks using matrix permutation methods, A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems, A survey on the linear ordering problem for weighted or unweighted tournaments, Relationships Between $l^1 $ Metrics on Rankings: The Case of Ties, Unnamed Item, Rankability and linear ordering problem: probabilistic insight and algorithms, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, A branch and bound algorithm for the acyclic subgraph problem, The median procedure in cluster analysis and social choice theory, Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Stochastic transitivity: axioms and models, Induced binary probabilities and the linear ordering polytope: A status report, Ising formulations of some graph-theoretic problems in psychological research: models and methods, An updated survey on the linear ordering problem for weighted or unweighted tournaments, NP-hardness results for the aggregation of linear orders into median orders, Median linear orders: Heuristics and a branch and bound algorithm, Unnamed Item, Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
