ISBN: 9781441936660 - handbook of combinatorial optimization: supplement volume b (10 resultados)

Condición: New.

Condición: As New. Unread book in perfect condition.

Taschenbuch. Condición: Neu. Handbook of Combinatorial Optimization | Supplement Volume B | Ding-Zhu Du | Taschenbuch | viii | Englisch | 2011 | Springer Us | EAN 9781441936660 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Taschenbuch. Condición: 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).…

Condición: 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 .

Paperback. Condición: Brand New. supplement edition. 408 pages. 9.61x6.61x1.97 inches. In Stock.

Condición: New. pp. 404.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimizationset. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way. 404 pp. Englisch.…

Condición: New. Print on Demand pp. 404 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condición: New. PRINT ON DEMAND pp. 404.