Testing probabilistic models of choice using column generation
From MaRDI portal
Publication:1652625
DOI10.1016/j.cor.2018.03.001zbMath1458.91069OpenAlexW2592368094WikidataQ92986159 ScholiaQ92986159MaRDI QIDQ1652625
Frits C. R. Spieksma, Michel Regenwetter, Clintin P. Davis-Stober, Bart Smeulders
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc6224134
Decision theory (91B06) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Ising formulations of some graph-theoretic problems in psychological research: models and methods ⋮ Block-insertion-based algorithms for the linear ordering problem ⋮ Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lexicographic semiorder polytope and probabilistic representations of choice
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- The Bayes factor for inequality and about equality constrained models
- Mixtures of order matrices and generalized order matrices
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- Geometric algorithms and combinatorial optimization.
- Testing a mixture model of single-peaked preferences
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- A survey on the linear ordering problem for weighted or unweighted tournaments
- A Linear Programming Approach to the Cutting-Stock Problem
- Selected Topics in Column Generation
- 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
This page was built for publication: Testing probabilistic models of choice using column generation
