This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Kasperski, Adam
Zielinski, Pawel
Abstract

This paper deals with a general combinatorial optimization problem in which closed intervals and fuzzy intervals model uncertain element weights. The notion of a deviation interval is introduced, which allows us to characterize the optimality and the robustness of solutions and elements. The problem of computing deviation intervals is addressed and some new complexity results in this field are provided. Possibility theory is then applied to generalize a deviation interval and a solution concept to fuzzy ones.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.sciencedirect.com/science/article/B6VCT-4VJBTPT-6/2/a833bf1619a1e196a14d571b76500889
File Format:
File Function:
Download Restriction: Full text for ScienceDirect subscribers only

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Publisher Info
Article provided by Elsevier in its journal European Journal of Operational Research.

Volume (Year): 200 (2010)
Issue (Month): 3 (February)
Pages: 680-687
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:eee:ejores:v:200:y:2010:i:3:p:680-687

Contact details of provider:
Web page: http://www.elsevier.com/locate/eor

For technical questions regarding this item, or to correct its listing, contact: (Heidi Boesdal).

Related research
Keywords: Minmax regret Interval Possibility theory Combinatorial optimization;

Statistics
Access and download statistics

Did you know? You too can volunteer for RePEc, for example by encouraging others to register as authors.

This page was last updated on 2009-12-3.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.