Combinatorial Global Optimization (18 results)
Language: English
Published by World Scientific Pub Co Inc, Hackensack, New Jersey, U.S.A., 2002
- Hardcover
- First Edition
Seller: Alexander Books (ABAC/ILAB), Ancaster, ON, CanadaAlexander Books (ABAC/ILAB)
Contact seller5-star sellerCondition: Used - Near fine
£ 27.15
£ 6.02 shippingShips from Canada to U.S.A.Quantity: 1 available
Hardcover. Condition: Near Fine. Dust Jacket Condition: Fine. First Edition. 355p. Bookplate o/w fine. Book.
- Hardcover
Seller: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contact seller5-star sellerCondition: New
£ 62.50
Free ShippingShips within U.S.A.Quantity: 5 available
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
- Hardcover
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.Romtrade Corp.
Contact seller5-star sellerCondition: New
£ 64.55
Free ShippingShips within U.S.A.Quantity: 5 available
Condition: 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.
- Hardcover
Seller: SMASS Sellers, IRVING, TX, U.S.A.SMASS Sellers
Contact seller4-star sellerCondition: New
£ 66.99
Free ShippingShips within U.S.A.Quantity: 5 available
Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
- Hardcover
- International Edition
Seller: UK BOOKS STORE, London, LONDO, United KingdomUK BOOKS STORE
Contact seller5-star sellerInternational EditionCondition: New
£ 83.99
Free ShippingShips from United Kingdom to U.S.A.Quantity: 12 available
Condition: New. Brand New! Fast Delivery This is an 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 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if th…e Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
- Hardcover
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.Romtrade Corp.
Contact seller5-star sellerCondition: New
£ 88.09
Free ShippingShips within U.S.A.Quantity: 1 available
Condition: 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.
- Hardcover
Seller: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contact seller5-star sellerCondition: New
£ 88.09
Free ShippingShips within U.S.A.Quantity: 1 available
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 96.88
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Hardcover
Seller: Buchpark, Trebbin, GermanyBuchpark
Contact seller5-star sellerCondition: Used - Fine
£ 21.71
£ 89.97 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: 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 salesma…n 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.
- Hardcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 130.00
£ 10.00 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. hardback/cd-rom edition. 211 pages. 9.50x6.50x0.50 inches. In Stock.
More images- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 84.06
£ 59.98 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization | Godfrey C. Onwubolu (u. a.) | Taschenbuch | xvii | Englisch | 2017 | Springer | EAN 9783662518922 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]ha…rtmann[at]springer[dot]com | Anbieter: preigu.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 98.27
£ 52.95 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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.
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 100.93
£ 53.39 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: 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.
Language: English
Published by Springer, 2009
- Hardcover
Seller: Books in my Basket, New Delhi, IndiaBooks in my Basket
Contact seller5-star sellerHardcover. Condition: New. ISBN:9783540921509.
- Hardcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 169.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Hardcover
Seller: Buchpark, Trebbin, GermanyBuchpark
Contact seller5-star sellerCondition: Used - Fine
£ 118.58
£ 89.97 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 372 | Sprache: Englisch | Produktart: Bücher | Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have…been developed that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated Goemans-Williamson relaxation of the maximum cut problem, and the Du-Hwang solution of the Gilbert-Pollak conjecture. Since integer constraints are equivalent to nonconvex constraints, the fundamental difference between classes of optimization problems is not between discrete and continuous problems but between convex and nonconvex optimization problems. This volume is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete, Greece.
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 94.42
£ 19.71 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - 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 o…rder 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. 232 pp. Englisch.
- Hardcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 94.42
£ 19.71 shippingShips from Germany to U.S.A.Quantity: 2 available
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 232 pp. Englisch.
