Discrete Optimization with Interval Data : Minmax Regret and Fuzzy Approach
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 sp...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Painos: | 1st ed. 2008. |
| Sarja: | Studies in Fuzziness and Soft Computing
|
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Discrete optimization with interval data, minmax regret and fuzzy approach, Adam Kasperski, Berlin, Springer, 2008, 1 vol. (xvi, 220 p.), Studies in fuzziness and soft computing, 978-3-540-78483-8 • Discrete Optimization with Interval Data, Texte imprimé, 9783642097201 • Discrete Optimization with Interval Data, Texte imprimé, 9783540849230 |
| LEADER | 04582nam a22003497a 4500 | ||
|---|---|---|---|
| 001 | 940422 | ||
| 008 | 080626q2000 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN125218397 | ||
| 020 | |a 9783540784845 | ||
| 041 | 0 | |a eng | |
| 082 | |a 519 | ||
| 100 | 1 | |a Kasperski, Adam. | |
| 245 | 1 | 0 | |a Discrete Optimization with Interval Data : |b Minmax Regret and Fuzzy Approach |c by Adam Kasperski. |
| 250 | |a 1st ed. 2008. | ||
| 260 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Studies in Fuzziness and Soft Computing |x 1860-0808 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 1 | |a 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 | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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 | ||
| 776 | 0 | |0 147868114 |t Discrete optimization with interval data |o minmax regret and fuzzy approach |f Adam Kasperski |c Berlin |n Springer |d 2008 |p 1 vol. (xvi, 220 p.) |s Studies in fuzziness and soft computing |z 978-3-540-78483-8 | |
| 776 | 0 | |t Discrete Optimization with Interval Data |b Texte imprimé |z 9783642097201 | |
| 776 | 0 | |t Discrete Optimization with Interval Data |b Texte imprimé |z 9783540849230 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-3-540-78484-5 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-MQWL3S8M-H |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747860858 |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-3-540-78484-5 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:75087838X |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-3-540-78484-5 |z Accès INSA CVL | |
| 997 | |0 940422 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||