Assortment Optimization Under the Paired Combinatorial Logit Model
From MaRDI portal
Publication:5130506
DOI10.1287/opre.2019.1930zbMath1445.90006OpenAlexW3019598628MaRDI QIDQ5130506
Heng Zhang, Huseyin Topaloglu, Paat Rusmevichientong
Publication date: 4 November 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2019.1930
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Combined gravity model trip distribution and paired combinatorial logit stochastic user equilibrium problem
- Computation and application of the paired combinatorial logit stochastic user equilibrium problem
- Assortment Optimization Under Variants of the Nested Logit Model
- The Design of Approximation Algorithms
- Iterative Methods in Combinatorial Optimization
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- The d-Level Nested Logit Model: Assortment and Price Optimization Problems
- Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model
- Technical Note—Two Properties of the Nested Logit Model
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
This page was built for publication: Assortment Optimization Under the Paired Combinatorial Logit Model