Handbook of Combinatorial Optimization: Supplement Volume A
Editat de Ding-Zhu Du, Panos M. Pardalosen Limba Engleză Hardback – 31 oct 1999
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (2) | 746.79 lei 39-44 zile | |
Springer Us – 13 apr 2011 | 746.79 lei 39-44 zile | |
Springer Us – 3 dec 2010 | 763.09 lei 39-44 zile | |
Hardback (1) | 773.08 lei 39-44 zile | |
Springer Us – 31 oct 1999 | 773.08 lei 39-44 zile |
Preț: 773.08 lei
Preț vechi: 1017.21 lei
-24%
Puncte Express: 1160
Preț estimativ în valută:
148.11€ • 160.43$ • 127.01£
148.11€ • 160.43$ • 127.01£
Carte tipărită la comandă
Livrare economică 06-11 mai
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792359241
ISBN-10: 0792359240
Pagini: 648
Ilustrații: VIII, 648 p.
Dimensiuni: 156 x 234 x 35 mm
Greutate: 1.09 kg
Ediția:1999
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
ISBN-10: 0792359240
Pagini: 648
Ilustrații: VIII, 648 p.
Dimensiuni: 156 x 234 x 35 mm
Greutate: 1.09 kg
Ediția:1999
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchDescriere
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).
Cuprins
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.
Textul de pe ultima copertă
This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set, as well as the Supplement Volume A. 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.
Audience
This handbook is suitable for all those who use combinatorial optimization methods to model and solve problems.
Audience
This handbook is suitable for all those who use combinatorial optimization methods to model and solve problems.
Caracteristici
The material presented in this supplement to the 3-volume Handbook of Combinatorial Optimization will be useful for any researcher who uses combinatorial optimization methods to solve problems
Includes supplementary material: sn.pub/extras
Includes supplementary material: sn.pub/extras