Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Scenario relaxation algorithm for finite scenario-based min–max regret and min–max relative regret robust optimization

10 references·5 citing·26 second hop

FromToDepth

this work references cited by second hop

References

2004The Price of Robustness4,620 cited
1998Robust Convex Optimization2,606 cited
2000Supply Chain Management: Strategy, Planning and Operations2,583 cited
1999Robust solutions of uncertain linear programs1,832 cited
2000Robust solutions of Linear Programming problems contaminated with uncertain data1,745 cited
1997Robust Discrete Optimization and Its Applications1,172 cited
1998Robust Discrete Optimization and Its Applications.1,060 cited
1999ROBUST SOLUTIONS TO UNCERTAIN PROGRAMS130 cited
2003Algorithms for Worst-Case Design and Applications to Risk Management129 cited
2003Algorithms for Worst-Case Design and Applications to Risk Management72 cited

Cited by

2012Lexicographic α-robustness: An alternative to min–max criteria51 cited
2007Min-Max Regret Robust Optimization Approach on Interval Data Uncertainty51 cited
2006Planning the e-Scrap Reverse Production System Under Uncertainty in the State of Georgia: A Case Study42 cited
2019Optimal computing budget allocation for complete ranking with input uncertainty41 cited
2017Optimizing an equilibrium supply chain network design problem by an improved hybrid biogeography based optimization algorithm

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

20 cited