0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Combinatorics & graph theory

Buy Now

Handbook of Combinatorial Optimization - Supplement Volume A (Hardcover, 1999 ed.) Loot Price: R4,735
Discovery Miles 47 350
Handbook of Combinatorial Optimization - Supplement Volume A (Hardcover, 1999 ed.): Dingzhu Du, Panos M. Pardalos

Handbook of Combinatorial Optimization - Supplement Volume A (Hardcover, 1999 ed.)

Dingzhu Du, Panos M. Pardalos

 (sign in to rate)
Loot Price R4,735 Discovery Miles 47 350 | Repayment Terms: R444 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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)."

General

Imprint: Springer
Country of origin: Netherlands
Release date: October 1999
First published: 1999
Editors: Dingzhu Du • Panos M. Pardalos
Dimensions: 234 x 156 x 34mm (L x W x T)
Format: Hardcover
Pages: 648
Edition: 1999 ed.
ISBN-13: 978-0-7923-5924-1
Categories: Books > Science & Mathematics > Mathematics > Probability & statistics
Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Promotions
LSN: 0-7923-5924-0
Barcode: 9780792359241

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Applied Combinatorics
Alan Tucker Hardcover R5,217 Discovery Miles 52 170
Introduction to Graph Theory
Robin J. Wilson Paperback R1,258 Discovery Miles 12 580
Handbook of Research on Advanced…
Madhumangal Pal, Sovan Samanta, … Hardcover R7,268 Discovery Miles 72 680
Mesh - Eine Reise Durch Die Diskrete…
Beau Janzen, Konrad Polthier Book R192 Discovery Miles 1 920
The Math Behind the Magic - Fascinating…
Ehrhard Behrends Paperback R988 Discovery Miles 9 880
Essential Topics in Combinatorics
Lucas Lincoln Hardcover R3,018 Discovery Miles 30 180
Counting: Solutions Manual (2nd Edition)
Khee Meng Koh, Eng Guan Tay Paperback R1,120 Discovery Miles 11 200
Counting (2nd Edition)
Khee Meng Koh, Eng Guan Tay Paperback R775 Discovery Miles 7 750
Algebraic Number Theory and Fermat's…
Ian Stewart, David Tall Paperback R1,368 Discovery Miles 13 680
Code Based Secret Sharing Schemes…
Patrick Sole, Selda Calkavur, … Hardcover R2,333 Discovery Miles 23 330
Combinatorial Functional Equations…
Yanpei Liu Hardcover R4,460 Discovery Miles 44 600
Algebraic Combinatorics
Eiichi Bannai, Etsuko Bannai, … Hardcover R4,263 Discovery Miles 42 630

See more

Partners