Order Total (1 Item Items):
Shipping Destination:
Handbook Combinatorial Optimization by Ding Zhu Panos (53 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (53)
- 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 (41)
- As New, Fine or Near Fine (8)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (3)
Binding
Collectible Attributes
- First Edition (2)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (22)
- Not Print on Demand (42)
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. *Price HAS BEEN REDUCED by 10% until Monday, Oct. 13 (weekend SALE item)* 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.26
Convert currencyUS$ 87.13 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.
-
Condition: New.
-
Handbook of Combinatorial Optimization
Published by Kluwer Academic Publishers, 1998
ISBN 10: 0792350189 ISBN 13: 9780792350187
Language: English
US$ 57.93
Convert currencyUS$ 121.99 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketCondition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.
-
Condition: New.
-
Handbook of Combinatorial Optimization (Paperback)
Published by Springer-Verlag New York Inc., New York, NY, 2010
ISBN 10: 1441948139 ISBN 13: 9781441948137
Language: English
First Edition
Paperback. Condition: new. Paperback. This volume can be considered as a supplementary volume to the major three-volume Handbook of Combinatorial Optimization published by Kluwer. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject including optimization problems and algorithmic approaches for discrete problems. Audience: All those who use combinatorial optimization methods to model and solve problems. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
US$ 179.25
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New.
-
Handbook of Combinatorial Optimization (Hardcover)
Published by Kluwer Academic Publishers, Dordrecht, 1999
ISBN 10: 0792359240 ISBN 13: 9780792359241
Language: English
Hardcover. Condition: new. Hardcover. This volume can be considered as a supplementary volume to the three-volume "Handbook of Combinatorial Optimization" published by Kluwer. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject including optimization problems and algorithmic approaches for discrete problems. This handbook deals with several algorithmic approaches for discrete problems as well as with many combinatorial optimization problems. Each chapter in the handbook is expository in nature, but scholarly in treatment. The book is addressed not only to researchers in discrete optimization, but to all scientists in various disciplines who use combinatorial optimization methods to model and solve problems. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
US$ 179.48
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Handbook of Combinatorial Optimization: Supplement Volume A
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 184.48
Convert currencyUS$ 16.00 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$ 184.48
Convert currencyUS$ 16.00 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$ 87.87
Convert currencyUS$ 121.99 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketCondition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.
-
Condition: As New. Unread book in perfect condition.
-
US$ 162.93
Convert currencyUS$ 56.92 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 162.93
Convert currencyUS$ 56.92 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$ 213.16
Convert currencyUS$ 56.92 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$ 199.13
Convert currencyUS$ 75.42 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
Published by Kluwer Academic Publishers, 1999
ISBN 10: 0792359240 ISBN 13: 9780792359241
Language: English
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
US$ 269.95
Convert currencyUS$ 12.20 shipping from Ireland to U.S.A.Quantity: 15 available
Add to basketCondition: New. Presents chapters dealing with various aspects of combinatorial optimization, including optimization problems and algorithmic approaches for discrete problems. This book is suitable for those who use combinatorial optimization methods to model and solve problems. Editor(s): Du, Ding-Zhu; Pardalos, Panos M. Num Pages: 656 pages, biography. BIC Classification: PBT; PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 34. Weight in Grams: 1094. . 1999. Hardback. . . . .
-
Handbook of Combinatorial Optimization : Supplement Volume A
Published by Springer US, Springer US, 1999
ISBN 10: 0792359240 ISBN 13: 9780792359241
Language: English
US$ 204.20
Convert currencyUS$ 76.35 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$ 272.77
Convert currencyUS$ 33.38 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$ 272.33
Convert currencyUS$ 33.38 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
-
US$ 277.46
Convert currencyUS$ 33.38 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.
-
Condition: As New. Unread book in perfect condition.
-
US$ 286.09
Convert currencyUS$ 33.38 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
-
Condition: As New. Unread book in perfect condition.
-
Handbook of Combinatorial Optimization
Published by Kluwer Academic Publishers, 1999
ISBN 10: 0792359240 ISBN 13: 9780792359241
Language: English
Condition: New. Presents chapters dealing with various aspects of combinatorial optimization, including optimization problems and algorithmic approaches for discrete problems. This book is suitable for those who use combinatorial optimization methods to model and solve problems. Editor(s): Du, Ding-Zhu; Pardalos, Panos M. Num Pages: 656 pages, biography. BIC Classification: PBT; PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 34. Weight in Grams: 1094. . 1999. Hardback. . . . . Books ship from the US and Ireland.
-
Handbook of Combinatorial Optimization (Paperback)
Published by Springer-Verlag New York Inc., New York, NY, 2010
ISBN 10: 1441948139 ISBN 13: 9781441948137
Language: English
First Edition
US$ 336.95
Convert currencyUS$ 37.00 shipping from Australia to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: new. Paperback. This volume can be considered as a supplementary volume to the major three-volume Handbook of Combinatorial Optimization published by Kluwer. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject including optimization problems and algorithmic approaches for discrete problems. Audience: All those who use combinatorial optimization methods to model and solve problems. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
