Verwandte Artikel zu Handbook of Combinatorial Optimization: Supplement...
Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:
Reseña del editor:
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).
Reseña del editor:
This volume can be considered as a supplementary volume to the major 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.
Audience: All those who use combinatorial optimization methods to model and solve problems.
Audience: All those who use combinatorial optimization methods to model and solve problems.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagSpringer
- Erscheinungsdatum1999
- ISBN 10 0792359240
- ISBN 13 9780792359241
- EinbandTapa dura
- Anzahl der Seiten660
- HerausgeberDu Ding-Zhu
Neu kaufen
Mehr zu diesem Angebot erfahren
EUR 136,16
Versand:
EUR 48,99
Von Deutschland nach USA
Beste Suchergebnisse beim ZVAB
Foto des Verkäufers
Handbook of Combinatorial Optimization
Anbieter:
Bewertung
Buchbeschreibung Gebunden. Zustand: New. Artikel-Nr. 5969024
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 136,16
Währung umrechnen
Foto des Verkäufers
Handbook of Combinatorial Optimization : Supplement Volume A
Anbieter:
Bewertung
Buchbeschreibung Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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). Artikel-Nr. 9780792359241
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 169,06
Währung umrechnen