Handbook of Combinatorial Optimization 1999 edition

Marc Notes: Includes bibliographical references and indexes. Table of Contents: Preface. The Maximum Clique Problem; I. M. Bomze, et al. Linear Assignment Problems and Extensions; R. E. Burkard, E. Cela. 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."Publisher Marketing: This volume can be considered as a supplementary volume to the three-volume Handbook of Combinatorial Optimization published by Kluwer. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject including optimization problems and algorithmic approaches for discrete problems.

Contributor Bio:  Du, Ding-Zhu DING-ZHU DU, PhD, is Professor of Computer Science at the University of Minnesota. KER-I KO, PhD, is Professor of Computer Science at the State University of New York at Stony Brook. The two are also coauthors of Theory of Computational Complexity (Wiley). Contributor Bio:  Pardalos, Panos M Panos M. Pardalos is one of the leading experts in global optimization and control theory. V. Yatsenko's research is connected with control of bilinear systems, nonlinear estimation, control of quantum systems, and globabl optimization problems. Both Pardalos and Yatsenko have authored numerous publications including books and well-known scientific journals.