EUR 19,79
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Très bon. Ancien livre de bibliothèque. Edition 1999. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1999. Ammareal gives back up to 15% of this item's net price to charity organizations.
Da: Alexander Books (ABAC/ILAB), Ancaster, ON, Canada
Hardcover. Condizione: Very Good. 880 Pages Usual Ex-Lib Marks O/W Sound.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Da: ALLBOOKS1, Direk, SA, Australia
EUR 60,44
Quantità: 1 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Da: NEPO UG, Rüsselsheim am Main, Germania
EUR 39,99
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Gut. Auflage: 1995. 898 Seiten Exemplar aus einer wissenchaftlichen Bibliothek Sprache: Englisch Gewicht in Gramm: 1494 25,4 x 17,8 x 5,7 cm, Gebundene Ausgabe.
Da: UK BOOKS STORE, London, LONDO, Regno Unito
EUR 69,53
Quantità: 12 disponibili
Aggiungi al carrelloCondizione: New. Brand New ! Fast Delivery "International Edition " and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 4-6 Working days .and we do have flat rate for up to 2LB. Extra shipping charges will be requested This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Condizione: New.
Condizione: New.
Da: ALLBOOKS1, Direk, SA, Australia
EUR 112,11
Quantità: 1 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Da: California Books, Miami, FL, U.S.A.
EUR 115,76
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 111,45
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 111,45
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: California Books, Miami, FL, U.S.A.
EUR 126,28
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 128,52
Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New. 2017. Paperback. . . . . .
Da: Revaluation Books, Exeter, Regno Unito
EUR 149,70
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. reprint edition. 232 pages. 9.25x6.10x0.53 inches. In Stock.
Da: Revaluation Books, Exeter, Regno Unito
EUR 151,35
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. hardback/cd-rom edition. 211 pages. 9.50x6.50x0.50 inches. In Stock.
Condizione: New. 2017. Paperback. . . . . . Books ship from the US and Ireland.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Apr 2017, 2017
ISBN 10: 3662518929 ISBN 13: 9783662518922
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 106,99
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Neuware -What is combinatorial optimization Traditionally, a problem is considered to be c- binatorial if its set of feasible solutions is both nite and discrete, i. e. , enumerable. For example, the traveling salesman problem asks in what order a salesman should visit the cities in his territory if he wants to minimize his total mileage (see Sect. 2. 2. 2). The traveling salesman problem¿s feasible solutions - permutations of city labels - c- prise a nite, discrete set. By contrast, Differential Evolution was originally designed to optimize functions de ned on real spaces. Unlike combinatorial problems, the set of feasible solutions for real parameter optimization is continuous. Although Differential Evolution operates internally with oating-point precision, it has been applied with success to many numerical optimization problems that have t- ditionally been classi ed as combinatorial because their feasible sets are discrete. For example, the knapsack problem¿s goal is to pack objects of differing weight and value so that the knapsack¿s total weight is less than a given maximum and the value of the items inside is maximized (see Sect. 2. 2. 1). The set of feasible solutions - vectors whose components are nonnegative integers - is both numerical and discrete. To handle such problems while retaining full precision, Differential Evolution copies oating-point - lutions to a temporary vector that, prior to being evaluated, is truncated to the nearest feasible solution, e. g. , by rounding the temporary parameters to the nearest nonnegative integer.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 232 pp. Englisch.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2017
ISBN 10: 3662518929 ISBN 13: 9783662518922
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 106,99
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - What is combinatorial optimization Traditionally, a problem is considered to be c- binatorial if its set of feasible solutions is both nite and discrete, i. e. , enumerable. For example, the traveling salesman problem asks in what order a salesman should visit the cities in his territory if he wants to minimize his total mileage (see Sect. 2. 2. 2). The traveling salesman problem's feasible solutions - permutations of city labels - c- prise a nite, discrete set. By contrast, Differential Evolution was originally designed to optimize functions de ned on real spaces. Unlike combinatorial problems, the set of feasible solutions for real parameter optimization is continuous. Although Differential Evolution operates internally with oating-point precision, it has been applied with success to many numerical optimization problems that have t- ditionally been classi ed as combinatorial because their feasible sets are discrete. For example, the knapsack problem's goal is to pack objects of differing weight and value so that the knapsack's total weight is less than a given maximum and the value of the items inside is maximized (see Sect. 2. 2. 1). The set of feasible solutions - vectors whose components are nonnegative integers - is both numerical and discrete. To handle such problems while retaining full precision, Differential Evolution copies oating-point - lutions to a temporary vector that, prior to being evaluated, is truncated to the nearest feasible solution, e. g. , by rounding the temporary parameters to the nearest nonnegative integer.
Lingua: Inglese
Editore: Springer, Berlin, Springer, 2009
ISBN 10: 3540921508 ISBN 13: 9783540921509
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 112,94
Quantità: 1 disponibili
Aggiungi al carrelloSonstige Video. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - What is combinatorial optimization Traditionally, a problem is considered to be c- binatorial if its set of feasible solutions is both nite and discrete, i. e. , enumerable. For example, the traveling salesman problem asks in what order a salesman should visit the cities in his territory if he wants to minimize his total mileage (see Sect. 2. 2. 2). The traveling salesman problem's feasible solutions - permutations of city labels - c- prise a nite, discrete set. By contrast, Differential Evolution was originally designed to optimize functions de ned on real spaces. Unlike combinatorial problems, the set of feasible solutions for real parameter optimization is continuous. Although Differential Evolution operates internally with oating-point precision, it has been applied with success to many numerical optimization problems that have t- ditionally been classi ed as combinatorial because their feasible sets are discrete. For example, the knapsack problem's goal is to pack objects of differing weight and value so that the knapsack's total weight is less than a given maximum and the value of the items inside is maximized (see Sect. 2. 2. 1). The set of feasible solutions - vectors whose components are nonnegative integers - is both numerical and discrete. To handle such problems while retaining full precision, Differential Evolution copies oating-point - lutions to a temporary vector that, prior to being evaluated, is truncated to the nearest feasible solution, e. g. , by rounding the temporary parameters to the nearest nonnegative integer.
Da: Buchpark, Trebbin, Germania
EUR 71,33
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | What is combinatorial optimization? Traditionally, a problem is considered to be c- binatorial if its set of feasible solutions is both ?nite and discrete, i. e. , enumerable. For example, the traveling salesman problem asks in what order a salesman should visit the cities in his territory if he wants to minimize his total mileage (see Sect. 2. 2. 2). The traveling salesman problem¿s feasible solutions - permutations of city labels - c- prise a ?nite, discrete set. By contrast, Differential Evolution was originally designed to optimize functions de?ned on real spaces. Unlike combinatorial problems, the set of feasible solutions for real parameter optimization is continuous. Although Differential Evolution operates internally with ?oating-point precision, it has been applied with success to many numerical optimization problems that have t- ditionally been classi?ed as combinatorial because their feasible sets are discrete. For example, the knapsack problem¿s goal is to pack objects of differing weight and value so that the knapsack¿s total weight is less than a given maximum and the value of the items inside is maximized (see Sect. 2. 2. 1). The set of feasible solutions - vectors whose components are nonnegative integers - is both numerical and discrete. To handle such problems while retaining full precision, Differential Evolution copies ?oating-point - lutions to a temporary vector that, prior to being evaluated, is truncated to the nearest feasible solution, e. g. , by rounding the temporary parameters to the nearest nonnegative integer.
Condizione: New.
Condizione: New.
Condizione: New.
Condizione: New.
Condizione: New.