Making Robust Decisions in Discrete Optimization Problems as a Game against Nature
In this paper a discrete optimization problem under uncertainty is discussed. Solving such a problem can be seen as a game against nature. In order to choose a solution, the minmax and minmax regret criteria can be applied. In this paper an extension of the known minmax (regret) approach is proposed. It is shown how different types of uncertainty can be simultaneously taken into account. Some exact and approximation algorithms for choosing a best solution are constructed.
Volume (Year): 2 (2008)
Issue (Month): 3 (December)
|Contact details of provider:|| Postal: |
Phone: +420 2 222112330
Fax: +420 2 22112304
Web page: http://ies.fsv.cuni.cz/Email:
More information through EDIRC
|Order Information:|| Web: http://auco.cuni.cz/ Email: |
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- 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.
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)
If references are entirely missing, you can add them using this form.