Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization
From MaRDI portal
(Redirected from Publication:322574)
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
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
- Disappointment in Decision Making Under Uncertainty
- Information Distortion in a Supply Chain: The Bullwhip Effect
- Mean-variance approximations to expected utility
- Metaheuristics. From design to implementation.
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Preface to the special issue: 60 years following Harry Markowitz's contributions in portfolio theory and operations research
- Regret in Decision Making under Uncertainty
- Robust Solutions to Uncertain Semidefinite Programs
- Robust assortment optimization in revenue management under the multinomial logit choice model
- Robust convex optimization
- Robust solutions of uncertain linear programs
- Zero-one programming with multiple criteria
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)
