Cite This Item

Copy Citation

MLA
“Minimax as a Robust Strategy for Discrete Rival Scenarios.” Algorithms for Worst-Case Design and Applications to Risk Management, by Berç Rustem and Melendres Howe, Princeton University Press, PRINCETON; OXFORD, 2002, pp. 121–138, www.jstor.org/stable/j.ctt7s093.9. Accessed 5 June 2020.
APA
Rustem, B., & Howe, M. (2002). Minimax as a robust strategy for discrete rival scenarios. In Algorithms for Worst-Case Design and Applications to Risk Management (pp. 121-138). PRINCETON; OXFORD: Princeton University Press. Retrieved June 5, 2020, from www.jstor.org/stable/j.ctt7s093.9
CHICAGO
Rustem, Berç, and Melendres Howe. "Minimax as a Robust Strategy for Discrete Rival Scenarios." In Algorithms for Worst-Case Design and Applications to Risk Management, 121-38. PRINCETON; OXFORD: Princeton University Press, 2002. Accessed June 5, 2020. www.jstor.org/stable/j.ctt7s093.9.

Export Citation

Export a RIS file (For EndNote, ProCite, Reference Manager, Zotero, Mendeley…)
Export a Text file (For BibTex)
Note: Always review your references and make any necessary corrections before using. Pay attention to names, capitalization, and dates.