AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Assortment Optimization Under the Mallows model

NeurIPS 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Predict-then-optimize learning · 16 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
strengthen MIP upper-bound constraints using structural properties of the optimal solution (ablation)MIP for Mallows assortment · n=25running timeHelped
increase n from 10 to 25strengthened MIP · e^-θ = 0.9, average running timerunning time (s): 4.72 -> 769.78Hurt
increase n from 10 to 25strengthened MIP · e^-θ = 0.8, average running timerunning time (s): 4.60 -> 143.21Hurt
increase e^-θ from 0.8 to 0.9strengthened MIP · n=25 average running timerunning time (s): 143.21 -> 769.78Hurt
increase e^-θ from 0.8 to 0.9strengthened MIP · n=25 max running timerunning time (s): 183.78 -> 1,817.98Hurt
increase e^-θ from 0.8 to 0.9strengthened MIP · n=10 average running timerunning time (s): 4.60 -> 4.72No clear effect
increase e^-θ from 0.8 to 0.9strengthened MIP · n=20 average running timerunning time (s): 48.08 -> 105.30Hurt
extend single Mallows to finite mixture of Mallows modelsMIP formulation · choice probabilityapplicabilityHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy