Order Total (1 Item Items):
Shipping Destination:
Handbook Combinatorial Optimization by Ding Zhu Pardalos (44 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (44)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (35)
- As New, Fine or Near Fine (5)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (3)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (16)
- Not Print on Demand (33)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Handbook of Combinatorial Optimization: Supplement Volume B
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Seller rating 5 out of 5 stars
Condition: Good. *FREE DOMESTIC SHIPPING until Monday, Sept. 22* 402 pp., Hardcover, ex library, light age toning to edges, else text and binding clean and tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
-
Handbook of Combinatorial Optimization: Supplement Volume B.
Published by Springer, 2004
Language: English
Seller: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Germany
Association Member: GIAQ
Seller rating 5 out of 5 stars
US$ 8.35
Convert currencyUS$ 88.10 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Wie neu. 402 S., Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 980.
-
US$ 71.37
Convert currencyUS$ 33.68 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Brand New. 1st edition. 2410 pages. 10.00x6.75x5.25 inches. In Stock.
-
Condition: New. SUPER FAST SHIPPING.
-
Condition: New. SUPER FAST SHIPPING.
-
US$ 179.25
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 179.48
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Handbook of Combinatorial Optimization
Published by Kluwer Academic Publishers, 1998
ISBN 10: 0792350189 ISBN 13: 9780792350187
Language: English
US$ 62.14
Convert currencyUS$ 123.34 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketCondition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.
-
Handbook of Combinatorial Optimization: Supplement Volume A
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 186.10
Convert currencyUS$ 16.14 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Handbook of Combinatorial Optimization: Supplement Volume A
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 186.10
Convert currencyUS$ 16.14 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Handbook of Combinatorial Optimization
Published by Kluwer Academic Publishers, 1998
ISBN 10: 0792352939 ISBN 13: 9780792352938
Language: English
US$ 79.96
Convert currencyUS$ 123.34 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketCondition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.
-
US$ 164.73
Convert currencyUS$ 57.55 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 164.73
Convert currencyUS$ 57.55 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketGebunden. Condition: New.
-
Condition: New. pp. 660.
-
Condition: New. pp. 660.
-
US$ 215.52
Convert currencyUS$ 57.55 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. The material presented in this supplement to the 3-volume Handbook of Combinatorial Optimization will be useful for any researcher who uses combinatorial optimization methods to solve problemsThe material presented in this supplement to the 3-volume .
-
US$ 201.33
Convert currencyUS$ 76.26 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dualheuristics).
-
Handbook of Combinatorial Optimization : Supplement Volume A
Published by Springer US, Springer US, 1999
ISBN 10: 0792359240 ISBN 13: 9780792359241
Language: English
US$ 206.45
Convert currencyUS$ 77.20 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketBuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dualheuristics).
-
US$ 270.72
Convert currencyUS$ 33.68 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPaperback. Condition: Brand New. supplement edition. 408 pages. 9.61x6.61x1.97 inches. In Stock.
-
US$ 274.73
Convert currencyUS$ 33.68 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
-
US$ 275.38
Convert currencyUS$ 33.68 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPaperback. Condition: Brand New. supplement edition. 656 pages. 9.25x6.25x1.49 inches. In Stock.
-
US$ 288.61
Convert currencyUS$ 33.68 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
-
US$ 326.73
Convert currencyUS$ 57.55 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 589.63
Convert currencyUS$ 57.55 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketGebunden. Condition: New.
-
Handbook of Combinatorial Optimization (Hardcover)
Published by Springer-Verlag New York Inc., New York, NY, 2013
ISBN 10: 1441979964 ISBN 13: 9781441979964
Language: English
Hardcover. Condition: new. Hardcover. The second edition of this 5-volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. This multi-volume work deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The editors have brought together almost every aspect of this enormous field of combinatorial optimization, an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communications networks, and management science. An international team of 30-40 experts in the field form the editorial board.The Handbook of Combinatorial Optimization, second edition is addressed to all scientists who use combinatorial optimization methods to model and solve problems. Experts in the field as well as non-specialists will find the material stimulating and useful. The second edition of this 5-volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
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.
-
US$ 2,990.39
Convert currencyUS$ 11.69 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketCondition: Used. pp. xxi + 3409.
-
US$ 1,945.68
Convert currencyFree shipping from Australia to U.S.A.Quantity: 1 available
Add to basketBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Handbook of Combinatorial Optimization
Published by Springer New York, Springer US, 2013
ISBN 10: 1441979964 ISBN 13: 9781441979964
Language: English
US$ 736.61
Convert currencyUS$ 106.01 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketBuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The second edition of this 5-volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. This multi-volume work deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The editors have brought together almost every aspect of this enormous field of combinatorial optimization, an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communications networks, and management science. An international team of 30-40 experts in the field form the editorial board.The Handbook of Combinatorial Optimization, second edition is addressed to all scientists who use combinatorial optimization methods to model and solve problems. Experts in the field as well as non-specialists will find the material stimulating and useful.
