Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
On the compatibility of nested logit models with utility maximization
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
Approximation schemes for NP-hard geometric optimization problems: a survey
Sampling and learning Mallows and generalized Mallows models under the Cayley distance
On the cycle structure of Mallows permutations
How unsplittable-flow-covering helps scheduling with job-dependent cost functions
Lengths of monotone subsequences in a Mallows permutation
Approximation algorithms for the generalized incremental knapsack problem
A Markov Chain Approximation to Choice Modeling
Assortment Optimization Under Variants of the Nested Logit Model
A quasi-PTAS for unsplittable flow on line graphs
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
A Column Generation Algorithm for Choice-Based Network Revenue Management
Discrete Choice Methods with Simulation
NON-NULL RANKING MODELS. I
Revenue Management Under a General Discrete Choice Model of Consumer Behavior
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
Approximation schemes for preemptive weighted flow time
Thermodynamic limit for the Mallows model on Sn
Specification Tests for the Multinomial Logit Model
Approximation Schemes for Minimum Latency Problems
Revenue Management Under the Markov Chain Choice Model
Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation
Technical Note—An Expectation-Maximization Algorithm to Estimate the Parameters of the Markov Chain Choice Model
Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice
Technical Note—Capacitated Assortment Optimization: Hardness and Approximation
The Approximability of Assortment Optimization Under Ranking Preferences
A Quasi-Polynomial Approximation for the Restricted Assignment Problem
An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem
Weighted Games of Best Choice
Approximation Algorithms for Dynamic Assortment Optimization Models
A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem
A quasi-polynomial time approximation scheme for minimum weight triangulation

This page was built for publication: Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings