Randomized algorithms for lexicographic inference
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5957322 (Why is no real title available?)
- scientific article; zbMATH DE number 3612277 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1522714 (Why is no real title available?)
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 3092990 (Why is no real title available?)
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Aggregating inconsistent information: ranking and clustering
- An experimental evaluation of a scatter search for the linear ordering problem
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Choice by elimination
- Continuity of Preference Relations for Separable Topologies
- Continuous representation of a preference relation on a connected topological space
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Error Theory for Elimination by Aspects
- Exact first-choice product line optimization
- Exact upper and lower bounds on the difference between the arithmetic and geometric means
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- Fast, frugal, and fit: simple heuristics for paired comparison
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- Lexicographic orders and preference representation
- Numerical representation of intransitive preferences on a countable set
- Optimizing product line designs: efficient methods and comparisons
- Representations of quasi-Newton matrices and their use in limited memory methods
- Robust product line design
- Technical note: Mathematical properties of the optimal product line selection problem using choice-based conjoint analysis
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- The linear ordering problem: instances, search space analysis and algorithms
- The no-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo
- Variable neighborhood search for the linear ordering problem
- Voting schemes for which it can be difficult to tell who won the election
Cited in
(4)
This page was built for publication: Randomized algorithms for lexicographic inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5126607)
