Da: California Books, Miami, FL, U.S.A.
EUR 18,62
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: California Books, Miami, FL, U.S.A.
EUR 24,83
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 16,02
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 23,83
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 22,88
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. KlappentextrnrnSince the multidimensional knapsack problems are NP-hard problems, the exact solutions of knapsack problems often need excessive computing time and storage space. Thus, heuristic approaches are more practical for multidimensional .
Da: moluna, Greven, Germania
EUR 27,04
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. KlappentextrnrnThe multidimensional knapsack problem (MKP) has been used to model a variety of practical optimization and decision-making applications. Due to its combinatorial nature, heuristics are often employed to quickly find good solutions.
Lingua: Inglese
Editore: Creative Media Partners, LLC, 2012
ISBN 10: 1286861543 ISBN 13: 9781286861547
Da: PBShop.store US, Wood Dale, IL, U.S.A.
EUR 19,05
Quantità: Più di 20 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 17,59
Quantità: Più di 20 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 46,50
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Neuware - Since the multidimensional knapsack problems are NP-hard problems, the exact solutions of knapsack problems often need excessive computing time and storage space. Thus, heuristic approaches are more practical for multidimensional knapsack problems as problems get large. This thesis presents the results of an empirical study of the performance of heuristic solution procedures based on the coefficients correlation structures and constraint slackness settings. In this thesis, the three representative greedy heuristics, Toyoda, Senju and Toyoda, and Loulou and Michaelides' methods, are studied. The purpose of this research is to explore which heuristic of the three representative greedy heuristics performs best under certain combinations of conditions between constraint slackness and correlation structures. This thesis examines three heuristics over 1120 problems which are all the two-dimensional knapsack problems (2KPs) with 100 variables created by four constraint slackness settings and 45 feasible correlation structures. Then we analyze why the best heuristic behaves as it does as a function of problem characteristics. Finally we present two new heuristics using knowledge gained in the study. When these new heuristics are competitively tested against the three representative greedy heuristics, the results show the new heuristics perform better.
Da: PBShop.store US, Wood Dale, IL, U.S.A.
EUR 27,29
Quantità: Più di 20 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 23,90
Quantità: Più di 20 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.