Borrow it
 Architecture Library
 Bizzell Memorial Library
 Boorstin Collection
 Chinese Literature Translation Archive
 Engineering Library
 Fine Arts Library
 Harry W. Bass Business History Collection
 History of Science Collections
 John and Mary Nichols Rare Books and Special Collections
 Library Service Center
 Price College Digital Library
 Western History Collections
The Resource Discrete Optimization with Interval Data : Minmax Regret and Fuzzy Approach, by Adam Kasperski, (electronic resource)
Discrete Optimization with Interval Data : Minmax Regret and Fuzzy Approach, by Adam Kasperski, (electronic resource)
Resource Information
The item Discrete Optimization with Interval Data : Minmax Regret and Fuzzy Approach, by Adam Kasperski, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.This item is available to borrow from all library branches.
Resource Information
The item Discrete Optimization with Interval Data : Minmax Regret and Fuzzy Approach, by Adam Kasperski, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.
This item is available to borrow from all library branches.
 Summary
 In operations research applications we are often faced with the problem of incomplete or uncertain data. This book considers solving combinatorial optimization problems with imprecise data modeled by intervals and fuzzy intervals. It focuses on some basic and traditional problems, such as minimum spanning tree, shortest path, minimum assignment, minimum cut and various sequencing problems. The interval based approach has become very popular in the recent decade. Decision makers are often interested in hedging against the risk of poor (worst case) system performance. This is particularly important for decisions that are encountered only once. In order to compute a solution that behaves reasonably under any likely input data, the maximal regret criterion is widely used. Under this criterion we seek a solution that minimizes the largest deviation from optimum over all possible realizations of the input data. The minmax regret approach to discrete optimization with interval data has attracted considerable attention in the recent decade. This book summarizes the state of the art in the area and addresses some open problems. Furthermore, it contains a chapter devoted to the extension of the framework to the case when fuzzy intervals are applied to model uncertain data. The fuzzy intervals allow a more sophisticated uncertainty evaluation in the setting of possibility theory. This book is a valuable source of information for all operations research practitioners who are interested in modern approaches to problem solving. Apart from the description of the theoretical framework, it also presents some algorithms that can be applied to solve problems that arise in practice
 Language

 eng
 eng
 Edition
 1st ed. 2008.
 Extent
 1 online resource (XVI, 220 p.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Contents

 Minmax Regret Combinatorial Optimization Problems with Interval Data
 Problem Formulation
 Evaluation of Optimality of Solutions and Elements
 Exact Algorithms
 Approximation Algorithms
 Minmax Regret Minimum Selecting Items
 Minmax Regret Minimum Spanning Tree
 Minmax Regret Shortest Path
 Minmax Regret Minimum Assignment
 Minmax Regret Minimum s???t Cut
 Fuzzy Combinatorial Optimization Problem
 Conclusions and Open Problems
 Minmax Regret Sequencing Problems with Interval Data
 Problem Formulation
 Sequencing Problem with Maximum Lateness Criterion
 Sequencing Problem with Weighted Number of Late Jobs
 Sequencing Problem with the Total Flow Time Criterion
 Conclusions and Open Problems
 Discrete Scenario Representation of Uncertainty
 Isbn
 9783540784845
 Label
 Discrete Optimization with Interval Data : Minmax Regret and Fuzzy Approach
 Title
 Discrete Optimization with Interval Data
 Title remainder
 Minmax Regret and Fuzzy Approach
 Statement of responsibility
 by Adam Kasperski
 Language

 eng
 eng
 Summary
 In operations research applications we are often faced with the problem of incomplete or uncertain data. This book considers solving combinatorial optimization problems with imprecise data modeled by intervals and fuzzy intervals. It focuses on some basic and traditional problems, such as minimum spanning tree, shortest path, minimum assignment, minimum cut and various sequencing problems. The interval based approach has become very popular in the recent decade. Decision makers are often interested in hedging against the risk of poor (worst case) system performance. This is particularly important for decisions that are encountered only once. In order to compute a solution that behaves reasonably under any likely input data, the maximal regret criterion is widely used. Under this criterion we seek a solution that minimizes the largest deviation from optimum over all possible realizations of the input data. The minmax regret approach to discrete optimization with interval data has attracted considerable attention in the recent decade. This book summarizes the state of the art in the area and addresses some open problems. Furthermore, it contains a chapter devoted to the extension of the framework to the case when fuzzy intervals are applied to model uncertain data. The fuzzy intervals allow a more sophisticated uncertainty evaluation in the setting of possibility theory. This book is a valuable source of information for all operations research practitioners who are interested in modern approaches to problem solving. Apart from the description of the theoretical framework, it also presents some algorithms that can be applied to solve problems that arise in practice
 http://library.link/vocab/creatorName
 Kasperski, Adam
 Dewey number
 519.6/4
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsaut
 fV3PUhcDE4M
 Image bit depth
 0
 Language note
 English
 LC call number
 QA402.5402.6
 Literary form
 non fiction
 Series statement
 Studies in Fuzziness and Soft Computing,
 http://library.link/vocab/subjectName

 Mathematical optimization
 Engineering mathematics
 Artificial intelligence
 Optimization
 Mathematical and Computational Engineering
 Artificial Intelligence
 Label
 Discrete Optimization with Interval Data : Minmax Regret and Fuzzy Approach, by Adam Kasperski, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Contents
 Minmax Regret Combinatorial Optimization Problems with Interval Data  Problem Formulation  Evaluation of Optimality of Solutions and Elements  Exact Algorithms  Approximation Algorithms  Minmax Regret Minimum Selecting Items  Minmax Regret Minimum Spanning Tree  Minmax Regret Shortest Path  Minmax Regret Minimum Assignment  Minmax Regret Minimum s???t Cut  Fuzzy Combinatorial Optimization Problem  Conclusions and Open Problems  Minmax Regret Sequencing Problems with Interval Data  Problem Formulation  Sequencing Problem with Maximum Lateness Criterion  Sequencing Problem with Weighted Number of Late Jobs  Sequencing Problem with the Total Flow Time Criterion  Conclusions and Open Problems  Discrete Scenario Representation of Uncertainty
 Dimensions
 unknown
 Edition
 1st ed. 2008.
 Extent
 1 online resource (XVI, 220 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540784845
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/9783540784845
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000491677
 (SSID)ssj0000317243
 (PQKBManifestationID)11244128
 (PQKBTitleCode)TC0000317243
 (PQKBWorkID)10287221
 (PQKB)11260038
 (DEHe213)9783540784845
 (EXLCZ)991000000000491677
 Label
 Discrete Optimization with Interval Data : Minmax Regret and Fuzzy Approach, by Adam Kasperski, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Contents
 Minmax Regret Combinatorial Optimization Problems with Interval Data  Problem Formulation  Evaluation of Optimality of Solutions and Elements  Exact Algorithms  Approximation Algorithms  Minmax Regret Minimum Selecting Items  Minmax Regret Minimum Spanning Tree  Minmax Regret Shortest Path  Minmax Regret Minimum Assignment  Minmax Regret Minimum s???t Cut  Fuzzy Combinatorial Optimization Problem  Conclusions and Open Problems  Minmax Regret Sequencing Problems with Interval Data  Problem Formulation  Sequencing Problem with Maximum Lateness Criterion  Sequencing Problem with Weighted Number of Late Jobs  Sequencing Problem with the Total Flow Time Criterion  Conclusions and Open Problems  Discrete Scenario Representation of Uncertainty
 Dimensions
 unknown
 Edition
 1st ed. 2008.
 Extent
 1 online resource (XVI, 220 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540784845
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/9783540784845
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000491677
 (SSID)ssj0000317243
 (PQKBManifestationID)11244128
 (PQKBTitleCode)TC0000317243
 (PQKBWorkID)10287221
 (PQKB)11260038
 (DEHe213)9783540784845
 (EXLCZ)991000000000491677
Library Locations

Architecture LibraryBorrow itGould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US35.205706 97.445050



Chinese Literature Translation ArchiveBorrow it401 W. Brooks St., RM 414, Norman, OK, 73019, US35.207487 97.447906

Engineering LibraryBorrow itFelgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US35.205706 97.445050

Fine Arts LibraryBorrow itCatlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US35.210371 97.448244

Harry W. Bass Business History CollectionBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

History of Science CollectionsBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

John and Mary Nichols Rare Books and Special CollectionsBorrow it401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US35.207487 97.447906


Price College Digital LibraryBorrow itAdams Hall 102 307 West Brooks St., Norman, OK, 73019, US35.210371 97.448244

Western History CollectionsBorrow itMonnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US35.209584 97.445414
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/DiscreteOptimizationwithIntervalDataMinmax/1_KCvPGZj0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/DiscreteOptimizationwithIntervalDataMinmax/1_KCvPGZj0/">Discrete Optimization with Interval Data : Minmax Regret and Fuzzy Approach, by Adam Kasperski, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Discrete Optimization with Interval Data : Minmax Regret and Fuzzy Approach, by Adam Kasperski, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/DiscreteOptimizationwithIntervalDataMinmax/1_KCvPGZj0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/DiscreteOptimizationwithIntervalDataMinmax/1_KCvPGZj0/">Discrete Optimization with Interval Data : Minmax Regret and Fuzzy Approach, by Adam Kasperski, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>