Free Delivery Over $100
|
|
|||
|
||||
OverviewCombinatorial (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). Full Product DetailsAuthor: Ding-Zhu Du , Panos M. PardalosPublisher: Springer-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: 2005 ed. Dimensions: Width: 15.50cm , Height: 2.30cm , Length: 23.50cm Weight: 1.640kg ISBN: 9780387238296ISBN 10: 0387238298 Pages: 394 Publication Date: 17 December 2004 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsData Correcting Algorithms in Combinatorial Optimization.- The Steiner Ratio of Banach-Minkowski spaces - A Survey.- Probabilistic Verification and Non-Approximability.- Steiner Trees in Industry.- Network-based Models and Algorithms in Data Mining and Knowledge Discovery.- The Generalized Assignment Problem and Extensions.- Optimal Rectangular Partitions.- Connected Dominating Set in Sensor Networks and MANETs.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
