Handbook of Combinatorial Optimization: Supplement Volume A

ISBN 10: 0792359240 / ISBN 13: 9780792359241

Editore: Springer, 1999

Riguardo questo articolo

In.

Codice articolo ria9780792359241_new

Dati bibliografici

• Titolo: Handbook of Combinatorial Optimization: Supplement Volume A
• Editore: Springer
• Data di pubblicazione: 1999
• Lingua: Inglese
• ISBN 10: 0792359240
• ISBN 13: 9780792359241
• Rilegatura: Rilegato
• Condizione: New

Descrizione articolo

Riassunto

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

Contenuti

Preface. The Maximum Clique Problem; I.M. Bomze, et al. Linear Assignment Problems and Extensions; R.E. Burkard, E. Çela. Bin Packing Approximation Algorithms: Combinatorial Analysis; E.G. Coffman, et al. Feedback Set Problems; P. Festa, et al. Neural Networks Approaches for Combinatorial Optimization Problems; T.B. Trafalis, S. Kasap. Frequency Assignment Problems; R.A. Murphey, et al. Algorithms for the Satisfiability (SAT) Problem; J. Gu, et al. The Steiner Ratio of Lp-planes; J. Albrecht, D. Cieslik. A Cogitative Algorithm for Solving the Equal Circles Packing Problem; W. Huang, et al. Author Index. Subject Index.