Handbook of Combinatorial Optimization: Supplement Volume B

ISBN 10: 0387238298 / ISBN 13: 9780387238296

Editore: Springer, 2004

Riguardo questo articolo

Brand new book. Fast ship. Please provide full street address as we are not able to ship toPOboxaddress.

Codice articolo SHUB84624

Dati bibliografici

• Titolo: Handbook of Combinatorial Optimization: Supplement Volume B
• Editore: Springer
• Data di pubblicazione: 2004
• Lingua: Inglese
• ISBN 10: 0387238298
• ISBN 13: 9780387238296
• Rilegatura: Rilegato
• Condizione: nuovo

Descrizione articolo

Riassunto

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

Dalla quarta di copertina

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.