Condizione: New. pp. 272.
Da: Revaluation Books, Exeter, Regno Unito
EUR 79,18
Quantitą: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 267 pages. 9.00x6.00x0.62 inches. In Stock.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 104,93
Quantitą: Pił di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 102,18
Quantitą: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 56,97
Quantitą: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 ).
Da: preigu, Osnabrück, Germania
EUR 50,40
Quantitą: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Nested Partitions Method, Theory and Applications | Leyuan Shi (u. a.) | Taschenbuch | x | Englisch | 2010 | Springer | EAN 9781441944207 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 111,42
Quantitą: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. Like New. book.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 46,22
Quantitą: Pił di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo č un articolo print on demand.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Quantitą: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 ). 272 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 80,60
Quantitą: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 272 29 illus.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 80,90
Quantitą: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 272.
Da: moluna, Greven, Germania
EUR 47,23
Quantitą: Pił di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Nested Partitions (NP) framework combines well-known optimization techniques with problem-specific local search heuristics for increased effectivenessEmphasizes the solution of real-world problems in a broad range of areas, from telecommunications.
Lingua: Inglese
Editore: Springer, Springer Nov 2010, 2010
ISBN 10: 1441944206 ISBN 13: 9781441944207
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Quantitą: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 ).Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 272 pp. Englisch.