Items related to Handbook of Combinatorial Optimization: Supplement...
Synopsis
Handbook of Combinatorial Optimization: Supplement volume A 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.
"synopsis" may belong to another edition of this title.
- PublisherSpringer
- Publication date2010
- ISBN 10 1441948139
- ISBN 13 9781441948137
- BindingPaperback
- LanguageEnglish
- Number of pages656
- EditorDu Ding-Zhu, Pardalos Panos M.
Search results for Handbook of Combinatorial Optimization: Supplement...
Stock Image
Handbook of Combinatorial Optimization: Supplement Volume A
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar2411530296233
Quantity: Over 20 available
Stock Image
Handbook of Combinatorial Optimization: Supplement Volume A
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9781441948137_new
Quantity: Over 20 available
Seller Image
Handbook of Combinatorial Optimization
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. dual heuristics). 660 pp. Englisch. Seller Inventory # 9781441948137
Quantity: 2 available
Seller Image
Handbook of Combinatorial Optimization
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 4175141
Quantity: Over 20 available
Seller Image
Handbook of Combinatorial Optimization : Supplement Volume A
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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). Seller Inventory # 9781441948137
Quantity: 1 available
Stock Image
Handbook of Combinatorial Optimization
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 660. Seller Inventory # 263064230
Quantity: 4 available
Stock Image
Handbook of Combinatorial Optimization: Supplement Volume A
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. supplement edition. 656 pages. 9.25x6.25x1.49 inches. In Stock. Seller Inventory # x-1441948139
Quantity: 2 available
Stock Image
Handbook of Combinatorial Optimization: Supplement Volume A
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. Like New. book. Seller Inventory # ERICA77314419481396
Quantity: 1 available
Stock Image
Handbook of Combinatorial Optimization
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 660 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 5865081
Quantity: 4 available
Stock Image
Handbook of Combinatorial Optimization
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 660. Seller Inventory # 183064236
Quantity: 4 available