Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization
DOI10.1016/J.EJOR.2015.10.014zbMATH Open1346.90048OpenAlexW2184455707MaRDI QIDQ322574FDOQ322574
Authors: Robert P. Rooderkerk, Harald J. van Heerde 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.10.014
Recommendations
- Robust assortment optimization using worst-case CVaR under the multinomial logit model
- Optimal retail assortments for substitutable items purchased in sets
- Robust assortment optimization in revenue management under the multinomial logit choice model
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- A fast algorithm for assortment optimization problems
Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31) Inventory, storage, reservoirs (90B05)
Cites Work
- Title not available (Why is that?)
- Mean-variance approximations to expected utility
- Title not available (Why is that?)
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Title not available (Why is that?)
- Metaheuristics. From design to implementation.
- Robust solutions of uncertain linear programs
- Information Distortion in a Supply Chain: The Bullwhip Effect
- Robust convex optimization
- Regret in Decision Making under Uncertainty
- Robust Solutions to Uncertain Semidefinite Programs
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Disappointment in Decision Making Under Uncertainty
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
- Zero-one programming with multiple criteria
- Preface to the special issue: 60 years following Harry Markowitz's contributions in portfolio theory and operations research
- Robust assortment optimization in revenue management under the multinomial logit choice model
Cited In (8)
- Assortment planning for multiple chain stores
- Evolutionary robust optimization in production planning -- interactions between number of objectives, sample size and choice of robustness measure
- An integrated multi-objective multi-product inventory managed production planning problem under uncertain environment
- An exact decomposition algorithm for the generalized knapsack sharing problem
- Robust assortment optimization under sequential product unavailability
- Robust traveling salesman problem with drone: balancing risk and makespan in contactless delivery
- Retail store operations: literature review and research directions
- An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems
This page was built for publication: Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322574)
