Making Robust Decisions in Discrete Optimization Problems as a Game against Nature
Download full text from publisher
References listed on IDEAS
- Montemanni, R. & Gambardella, L. M., 2005. "A branch and bound algorithm for the robust spanning tree problem with interval data," European Journal of Operational Research, Elsevier, vol. 161(3), pages 771-779, March.
More about this item
KeywordsDiscrete optimization; minmax; minmax regret; game against nature;
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- C79 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Other
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:fau:aucocz:au2008_237. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lenka Stastna). General contact details of provider: http://edirc.repec.org/data/icunicz.html .