Product Type
Condition
Binding
Collectible Attributes
Free Shipping
Seller Location
Seller Rating
Published by Springer, 2004
Seller: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Germany
Association Member: GIAQ
Book
Hardcover. 402 S., Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 980.
Published by Springer, 2004
ISBN 10: 0387238298ISBN 13: 9780387238296
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Book
Condition: Good. 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.
Published by Springer, 2011
ISBN 10: 1441936661ISBN 13: 9781441936660
Seller: booksXpress, Bayonne, NJ, U.S.A.
Book
Soft Cover. Condition: new.
Published by Springer, 2004
ISBN 10: 0387238298ISBN 13: 9780387238296
Seller: booksXpress, Bayonne, NJ, U.S.A.
Book
Hardcover. Condition: new.
Published by Springer, 1999
ISBN 10: 0792359240ISBN 13: 9780792359241
Seller: booksXpress, Bayonne, NJ, U.S.A.
Book
Hardcover. Condition: new.
Published by Springer, 2010
ISBN 10: 1441948139ISBN 13: 9781441948137
Seller: booksXpress, Bayonne, NJ, U.S.A.
Book Print on Demand
Soft Cover. Condition: new. This item is printed on demand.
Published by Springer, 2011
ISBN 10: 1441936661ISBN 13: 9781441936660
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Springer, 2004
ISBN 10: 0387238298ISBN 13: 9780387238296
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Springer, 2010
ISBN 10: 1441948139ISBN 13: 9781441948137
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Springer, 1999
ISBN 10: 0792359240ISBN 13: 9780792359241
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Springer, 2004
ISBN 10: 0387238298ISBN 13: 9780387238296
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer, 2010
ISBN 10: 1441948139ISBN 13: 9781441948137
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer, 1999
ISBN 10: 0792359240ISBN 13: 9780792359241
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer US, 2011
ISBN 10: 1441936661ISBN 13: 9781441936660
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book
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 ma- ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, a- line crew scheduling, corporate planning, computer-aided design and m- 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, allo- 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 discov- ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These al- 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 ad- tion, linear programming relaxations are often the basis for many appro- mation algorithms for solving NP-hard problems (e.g. dual heuristics).
Published by Springer US, 2010
ISBN 10: 1441948139ISBN 13: 9781441948137
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book
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).
Published by Springer US, 1999
ISBN 10: 0792359240ISBN 13: 9780792359241
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book
Buch. 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).
Published by Springer, 2004
ISBN 10: 1441936661ISBN 13: 9781441936660
Seller: Revaluation Books, Exeter, United Kingdom
Book
Paperback. Condition: Brand New. supplement edition. 408 pages. 9.61x6.61x1.97 inches. In Stock.
Published by Springer US, 1999
ISBN 10: 1441948139ISBN 13: 9781441948137
Seller: Revaluation Books, Exeter, United Kingdom
Book
Paperback. Condition: Brand New. supplement edition. 656 pages. 9.25x6.25x1.49 inches. In Stock.
Published by Springer, 2011
ISBN 10: 1441936661ISBN 13: 9781441936660
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer US, 2004
ISBN 10: 0387238298ISBN 13: 9780387238296
Seller: moluna, Greven, Germany
Book
Gebunden. Condition: 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 .
Published by Springer, 2010
ISBN 10: 1441948139ISBN 13: 9781441948137
Seller: Mispah books, Redhill, SURRE, United Kingdom
Book
Paperback. Condition: Like New. Like New. book.
Published by Springer, 1999
ISBN 10: 0792359240ISBN 13: 9780792359241
Seller: Mispah books, Redhill, SURRE, United Kingdom
Book
Hardcover. Condition: Like New. Like New. book.
Published by Springer, 2004
ISBN 10: 0387238298ISBN 13: 9780387238296
Seller: Mispah books, Redhill, SURRE, United Kingdom
Book
Hardcover. Condition: Like New. Like New. book.