Nested Partitions Method, Theory and Applications

Shi, Leyuan; O'lafsson, Sigurdur

ISBN 10: 1441944206 ISBN 13: 9781441944207
Edité par Springer-Verlag New York Inc., 2010
Neuf(s) Couverture souple

Vendeur Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Vendeur AbeBooks depuis 27 février 2001


A propos de cet article

Description :

There is an ever-increasing need to solve optimization problems in a wide variety of science and engineering applications. This up-to-date and highly relevant book provides a cutting-edge research tool to use for large-scale, complex systems optimization. Series: International Series in Operations Research & Management Science. Num Pages: 260 pages, 51 black & white tables, biography. BIC Classification: KJMV5; KJT; PBKS; PBUH; PBWH. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 14. Weight in Grams: 421. . 2010. 1st ed. Softcover of orig. ed. 2009. Paperback. . . . . N° de réf. du vendeur V9781441944207

Signaler cet article

Synopsis :

Thesubjectofthisbookisthenested partitions method(NP),arelativelynew optimization method that has been found to be very e?ective solving discrete optimization problems. Such discrete problems are common in many practical applications and the NP method is thus useful in diverse application areas. It can be applied to both operational and planning problems and has been demonstrated to e?ectively solve complex problems in both manufacturing and service industries. To illustrate its broad applicability and e?ectiveness, in this book we will show how the NP method has been successful in solving complex problems in planning and scheduling, logistics and transportation, supply chain design, data mining, and health care. All of these diverse app- cationshaveonecharacteristicincommon:theyallleadtocomplexlarge-scale discreteoptimizationproblemsthatareintractableusingtraditionaloptimi- tion methods. 1.1 Large-Scale Optimization IndevelopingtheNPmethodwewillconsideroptimization problemsthatcan be stated mathematically in the following generic form: minf(x), (1.1) x?X where the solution space or feasible region X is either a discrete or bounded ? set of feasible solutions. We denote a solution to this problem x and the ? ? objective function value f = f (x ).

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Détails bibliographiques

Titre : Nested Partitions Method, Theory and ...
Éditeur : Springer-Verlag New York Inc.
Date d'édition : 2010
Reliure : Couverture souple
Etat : New
Edition : Edition originale

Meilleurs résultats de recherche sur AbeBooks

Image d'archives

Leyuan Shi
ISBN 10 : 1441944206 ISBN 13 : 9781441944207
Neuf Paperback Edition originale

Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Paperback. Etat : new. Paperback. Thesubjectofthisbookisthenested partitions method(NP),arelativelynew optimization method that has been found to be very e?ective solving discrete optimization problems. Such discrete problems are common in many practical applications and the NP method is thus useful in diverse application areas. It can be applied to both operational and planning problems and has been demonstrated to e?ectively solve complex problems in both manufacturing and service industries. To illustrate its broad applicability and e?ectiveness, in this book we will show how the NP method has been successful in solving complex problems in planning and scheduling, logistics and transportation, supply chain design, data mining, and health care. All of these diverse app- cationshaveonecharacteristicincommon:theyallleadtocomplexlarge-scale discreteoptimizationproblemsthatareintractableusingtraditionaloptimi- tion methods. 1.1 Large-Scale Optimization IndevelopingtheNPmethodwewillconsideroptimization problemsthatcan be stated mathematically in the following generic form: minf(x), (1.1) x?X where the solution space or feasible region X is either a discrete or bounded ? set of feasible solutions. We denote a solution to this problem x and the ? ? objective function value f = f (x ). Thesubjectofthisbookisthenested partitions method(NP),arelativelynew optimization method that has been found to be very e?ective solving discrete optimization problems. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9781441944207

Contacter le vendeur

Acheter neuf

EUR 56,28
Autre devise
Frais de port : EUR 64,56
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Leyuan Shi
ISBN 10 : 1441944206 ISBN 13 : 9781441944207
Neuf Paperback Edition originale

Vendeur : AussieBookSeller, Truganina, VIC, Australie

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Paperback. Etat : new. Paperback. Thesubjectofthisbookisthenested partitions method(NP),arelativelynew optimization method that has been found to be very e?ective solving discrete optimization problems. Such discrete problems are common in many practical applications and the NP method is thus useful in diverse application areas. It can be applied to both operational and planning problems and has been demonstrated to e?ectively solve complex problems in both manufacturing and service industries. To illustrate its broad applicability and e?ectiveness, in this book we will show how the NP method has been successful in solving complex problems in planning and scheduling, logistics and transportation, supply chain design, data mining, and health care. All of these diverse app- cationshaveonecharacteristicincommon:theyallleadtocomplexlarge-scale discreteoptimizationproblemsthatareintractableusingtraditionaloptimi- tion methods. 1.1 Large-Scale Optimization IndevelopingtheNPmethodwewillconsideroptimization problemsthatcan be stated mathematically in the following generic form: minf(x), (1.1) x?X where the solution space or feasible region X is either a discrete or bounded ? set of feasible solutions. We denote a solution to this problem x and the ? ? objective function value f = f (x ). Thesubjectofthisbookisthenested partitions method(NP),arelativelynew optimization method that has been found to be very e?ective solving discrete optimization problems. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N° de réf. du vendeur 9781441944207

Contacter le vendeur

Acheter neuf

EUR 105,77
Autre devise
Frais de port : EUR 31,85
De Australie vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier