Pages that link to "Item:Q496669"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669):
Displaying 36 items.
- A review of choice-based revenue management: theory and methods (Q724103) (← links)
- Exact approaches for competitive facility location with discrete attractiveness (Q828655) (← links)
- Assortment optimization under the sequential multinomial logit model (Q1631528) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
- Combinatorial assortment optimization (Q2190396) (← links)
- Discovering heterogeneous consumer groups from sales transaction data (Q2272326) (← links)
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments (Q2300720) (← links)
- An efficient method for joint product line selection and pricing with fixed costs (Q2414119) (← links)
- On the linear integration of attraction choice models in business optimization problems (Q2661954) (← links)
- Product line optimization with multiples sites (Q2676378) (← links)
- On a piecewise-linear approximation for network revenue management (Q2800364) (← links)
- A branch-and-cut algorithm for the latent class logit assortment problem (Q2883584) (← links)
- Exact and asymptotically exact solutions for a class of assortment problems (Q2901042) (← links)
- A survey of assortment optimization problems under logit-based discrete choice models (Q3176074) (← links)
- Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings (Q3386805) (← links)
- Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds (Q3466778) (← links)
- Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model (Q4971390) (← links)
- Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences (Q4971565) (← links)
- Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection (Q5031641) (← links)
- Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets (Q5058044) (← links)
- Technical Note—Capacitated Assortment Optimization: Hardness and Approximation (Q5080651) (← links)
- Pricing Competition Under Specific Discrete Choice Models (Q5112421) (← links)
- Technical Note—Assortment Optimization with Small Consideration Sets (Q5129194) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- The Approximability of Assortment Optimization Under Ranking Preferences (Q5131544) (← links)
- Constrained multi‐location assortment optimization under the multinomial logit model (Q6057030) (← links)
- Data‐driven research in retail operations—A review (Q6072168) (← links)
- A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming (Q6092601) (← links)
- Callable products with dependent demands (Q6093549) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q6589754) (← links)
- An enhanced conic reformulation for capacity-constrained assortment optimization under the mixture of multinomial logit model (Q6601972) (← links)
- Assortment optimization: a systematic literature review (Q6667801) (← links)