+612 9045 4394
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Handbook of Combinatorial Optimization : Supplement Volume a - Ding-Zhu Du

Handbook of Combinatorial Optimization

Supplement Volume a

By: Ding-Zhu Du (Editor), Panos M. Pardalos (Editor)

Hardcover Published: 31st October 1999
ISBN: 9780792359241
Number Of Pages: 648

Share This Book:


or 4 easy payments of $73.38 with Learn more
Ships in 10 to 15 business days

Earn 587 Qantas Points
on this Book

Other Available Editions (Hide)

  • Paperback View Product Published: 13th April 2011
    Ships in 10 to 15 business days
  • Paperback View Product Published: 3rd December 2010
    Ships in 10 to 15 business 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).

Data Correcting Algorithms in Combinatorial Optimization
The Steiner Ratio of Banach-Minkowski Space
Probabilistic Verification and Non-Approximability
Steiner Trees in Industry
Network-Based Model and Algorithms in Data Mining and Knowledge Discovery
The Generalized Assignment Problem and Extensions
Optimal Rectangular Partitions
Connected Dominating Sets in Sensor Networks and MANETs
Author Index
Subject Index
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780792359241
ISBN-10: 0792359240
Audience: General
Format: Hardcover
Language: English
Number Of Pages: 648
Published: 31st October 1999
Country of Publication: NL
Dimensions (cm): 23.39 x 15.6  x 3.51
Weight (kg): 1.09

Earn 587 Qantas Points
on this Book