Pages that link to "Item:Q3100383"
From MaRDI portal
The following pages link to A Column Generation Algorithm for Choice-Based Network Revenue Management (Q3100383):
Displayed 50 items.
- Assortment optimization under a multinomial logit model with position bias and social influence (Q262450) (← links)
- A new bid price approach to dynamic resource allocation in network revenue management (Q323502) (← links)
- Network revenue management with inventory-sensitive bid prices and customer choice (Q421775) (← links)
- Improved bid prices for choice-based network revenue management (Q439392) (← links)
- Unconstraining methods in revenue management systems: research overview and prospects (Q447554) (← links)
- Model-based decision support for optimal brochure pricing: applying advanced analytics in the tour operating industry (Q480749) (← links)
- A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669) (← links)
- A review of choice-based revenue management: theory and methods (Q724103) (← links)
- Mathematical programming models for revenue management under customer choice (Q1046094) (← links)
- Assortment optimization under the sequential multinomial logit model (Q1631528) (← links)
- Least squares approximate policy iteration for learning bid prices in choice-based revenue management (Q1652041) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Assortment planning with nested preferences: dynamic programming with distributions as states? (Q1755798) (← links)
- Network capacity control under a nonparametric demand choice model (Q1785404) (← links)
- Assortment optimization over time (Q1785447) (← links)
- On upper bounds for assortment optimization under the mixture of multinomial logit models (Q1785635) (← links)
- Route-based approximate dynamic programming for dynamic pricing in attended home delivery (Q2023939) (← links)
- Alternate solution approaches for competitive hub location problems (Q2029306) (← links)
- Robust assortment optimization under sequential product unavailability (Q2160489) (← links)
- A review of revenue management: recent generalizations and advances in industry applications (Q2178060) (← links)
- Product-closing approximation for ranking-based choice network revenue management (Q2189895) (← links)
- Combinatorial assortment optimization (Q2190396) (← links)
- Efficient formulations for pricing under attraction demand models (Q2248752) (← links)
- Integrated revenue management approaches for capacity control with planned upgrades (Q2253355) (← links)
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
- Robust assortment optimization using worst-case CVaR under the multinomial logit model (Q2294358) (← links)
- Assortment planning for vertically differentiated products under a consider-then-choose model (Q2294368) (← links)
- Assortment optimization under the multinomial logit model with product synergies (Q2294378) (← links)
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments (Q2300720) (← links)
- The impact of customer behavior models on revenue management systems (Q2356169) (← links)
- A strong Lagrangian relaxation for general discrete-choice network revenue management (Q2419547) (← links)
- On the linear integration of attraction choice models in business optimization problems (Q2661954) (← links)
- On a Piecewise-Linear Approximation for Network Revenue Management (Q2800364) (← links)
- Technical Note—A Note on Relaxations of the Choice Network Revenue Management Dynamic Program (Q2806066) (← links)
- Assortment Optimization Under Variants of the Nested Logit Model (Q2875595) (← links)
- A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem (Q2883584) (← links)
- Appointment Scheduling Under Patient Preference and No-Show Behavior (Q2931701) (← links)
- New Formulations for Choice Network Revenue Management (Q2962567) (← links)
- A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice (Q3195240) (← links)
- Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings (Q3386805) (← links)
- The <i>d</i>-Level Nested Logit Model: Assortment and Price Optimization Problems (Q3453331) (← links)
- Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model (Q3465583) (← links)
- Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds (Q3466778) (← links)
- The Multiproduct Newsvendor Problem with Customer Choice (Q4969313) (← links)
- Technical Note—Capacitated Assortment Optimization Under the Multinomial Logit Model with Nested Consideration Sets (Q4969332) (← 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)
- Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice (Q5031618) (← 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)