Randomized Algorithms for Lexicographic Inference
From MaRDI portal
Publication:5126607
DOI10.1287/opre.2018.1794zbMath1455.90106OpenAlexW2922085772MaRDI QIDQ5126607
Vikram Kohli, Khaled Boughanmi, Rajeev Kohli
Publication date: 20 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2018.1794
analysis of algorithmsmaximum likelihooddiscrete optimizationrandomized algorithmsconsumer searchlexicographic rulesnoncompensatory choice
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Numerical representation of intransitive preferences on a countable set
- Continuous representation of a preference relation on a connected topological space
- Voting schemes for which it can be difficult to tell who won the election
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- Representations of quasi-Newton matrices and their use in limited memory methods
- Lexicographic orders and preference representation
- Fast, frugal, and fit: simple heuristics for paired comparison
- The linear ordering problem: instances, search space analysis and algorithms
- An experimental evaluation of a scatter search for the linear ordering problem
- Variable neighborhood search for the linear ordering problem
- Choice by elimination
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis
- Optimizing Product Line Designs: Efficient Methods and Comparisons
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Error Theory for Elimination by Aspects
- Continuity of Preference Relations for Separable Topologies
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Exact First-Choice Product Line Optimization
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- EXACT UPPER AND LOWER BOUNDS ON THE DIFFERENCE BETWEEN THE ARITHMETIC AND GEOMETRIC MEANS
- Robust Product Line Design
- Aggregating inconsistent information
