Handbook of Combinatorial Optimization (eBook)

Supplement Volume B

eBook Download: PDF

2006 | 2005
VIII, 394 Seiten
Springer US (Verlag)
978-0-387-23830-2 (ISBN)

Infos

This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way.

---

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

Inhalt

Preface – 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

Produkt-Details

• Erscheint lt. Verlag: 18.8.2006
• Mitarbeit: Stellvertretende Herausgeber: Ding-Zhu Du, Panos M. Pardalos
• Zusatzinfo: VIII, 394 p.
• Verlagsort: New York
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Informatik ► Theorie / Studium
• Themenwelt: Mathematik / Informatik ► Mathematik ► Graphentheorie
• Themenwelt: Naturwissenschaften
• Themenwelt: Technik
• Themenwelt: Wirtschaft ► Betriebswirtschaft / Management
• Schlagworte: algorithm • algorithms • combinatorial optimization • combinatorics • Data Mining • Model • Network • Networks • Optimization • Partition • verification
• ISBN-10: 0-387-23830-1 / 0387238301
• ISBN-13: 978-0-387-23830-2 / 9780387238302