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,822
Discovery Miles 48 220
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,822 Discovery Miles 48 220 | Repayment Terms: R452 pm x 12*

Bookmark and Share

Expected to ship within 12 - 19 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,539 Discovery Miles 55 390
Matroid Theory
James Oxley Hardcover R6,572 Discovery Miles 65 720
Graph Theory As I Have Known It
W. T. Tutte Hardcover R5,034 Discovery Miles 50 340
Combinatorics, Complexity, and Chance…
Geoffrey Grimmett, Colin McDiarmid Hardcover R4,461 Discovery Miles 44 610
Handbook of Research on Advanced…
Madhumangal Pal, Sovan Samanta, … Hardcover R7,657 Discovery Miles 76 570
Forbidden Configurations in Discrete…
David Eppstein Hardcover R3,467 Discovery Miles 34 670
Fixed Point Theory and Graph Theory…
Monther Alfuraidan, Qamrul Ansari Hardcover R2,886 Discovery Miles 28 860
Probability - Risk Management…
Daniel Covington Hardcover R1,012 Discovery Miles 10 120
Introduction to Graph Theory
Robin J. Wilson Paperback R1,395 Discovery Miles 13 950
Social Simulation for a Crisis - Results…
Frank Dignum Hardcover R5,048 Discovery Miles 50 480
Essential Topics in Combinatorics
Lucas Lincoln Hardcover R3,202 Discovery Miles 32 020
Counting: Solutions Manual (2nd Edition)
Khee Meng Koh, Eng Guan Tay Paperback R1,185 Discovery Miles 11 850

See more

Partners