Maximum likelihood paired comparison ranking by linear programming
From MaRDI portal
Cited in
(21)- A branch and bound algorithm for the acyclic subgraph problem
- The median procedure in cluster analysis and social choice theory
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Induced binary probabilities and the linear ordering polytope: A status report
- Stochastic transitivity: axioms and models
- Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
- Disentangling relationships in symptom networks using matrix permutation methods
- Ising formulations of some graph-theoretic problems in psychological research: models and methods
- NP-hardness results for the aggregation of linear orders into median orders
- A note on small linear-ordering polytopes
- 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
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
- scientific article; zbMATH DE number 3854180 (Why is no real title available?)
- Relationships Between l^1 Metrics on Rankings: The Case of Ties
- A new and flexible approach to the analysis of paired comparison data
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- Median linear orders: Heuristics and a branch and bound algorithm
- Rankability and linear ordering problem: probabilistic insight and algorithms
- Integer programming in psychology: a review and directions for future research
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
This page was built for publication: Maximum likelihood paired comparison ranking by linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5582743)
