Pages that link to "Item:Q5126613"
From MaRDI portal
The following pages link to Tractable Approximations for Assortment Planning with Product Costs (Q5126613):
Displaying 9 items.
- On the tightness of an LP relaxation for rational optimization and its applications (Q1755822) (← links)
- On upper bounds for assortment optimization under the mixture of multinomial logit models (Q1785635) (← links)
- Approximately global optimization for assortment problems using piecewise linearization techniques (Q1848593) (← links)
- Joint assortment and inventory optimization for vertically differentiated products under consumer-driven substitution (Q2140151) (← links)
- Robust assortment optimization under sequential product unavailability (Q2160489) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
- Joint promotional effort and assortment optimization under the multinomial logit model (Q6633266) (← links)
- Assortment optimization: a systematic literature review (Q6667801) (← links)