Robust optimization of the 0–1 knapsack problem: Balancing risk and return in assortment optimization-Reference-Cited by-同舟云学术

Robust optimization of the 0–1 knapsack problem: Balancing risk and return in assortment optimization

Published:2016-05 Issue:3 Volume:250 Page:842-854
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Rooderkerk Robert P.,van Heerde Harald J.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference35 articles.

1. Regret in decision-making under uncertainty;Bell;Operations Research,1982

2. Disappointment in decision-making under uncertainty;Bell;Operations Research,1985

3. Robust convex optimization;Ben-Tal;Mathematics of Operations Research,1998

4. Robust solutions of uncertain linear programs;Ben-Tal;Operations Research Letters,1999

5. In search of the bullwhip effect;Cachon;Manufacturing & Service Operations Management,2007

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems;Information Sciences;2023-11

2. Binary Honey Badger Algorithm for 0-1 Knapsack Problem;Journal of Intelligent Systems: Theory and Applications;2023-08-14

3. Set algebra — based algebraic evolutionary algorithm for binary optimization problems;Applied Soft Computing;2023-08

4. Study of Enterprise Resource Optimization Scheme from the Perspective of Knapsack Problems;Applied Mathematics and Nonlinear Sciences;2023-06-15

5. Robust assortment optimization under sequential product unavailability;European Journal of Operational Research;2022-12