Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Handbook of Combinatorial Optimization -

Handbook of Combinatorial Optimization

Supplement Volume A
Buch | Softcover
648 Seiten
2010 | Softcover reprint of hardcover 1st ed. 1999
Springer-Verlag New York Inc.
978-1-4419-4813-7 (ISBN)
CHF 224,65 inkl. MwSt
  • Versand in 10-15 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g.
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).

The Maximum Clique Problem.- Linear Assignment Problems and Extensions.- Bin Packing Approximation Algorithms: Combinatorial Analysis.- Feedback Set Problems.- Neural Networks Approaches for Combinatorial Optimization Problems.- Frequency Assignment Problems.- Algorithms for the Satisfiability (SAT) Problem.- The Steiner Ratio of Lp-planes.- A Cogitative Algorithm for Solving the Equal Circles Packing Problem.- Author Index.

Erscheint lt. Verlag 3.12.2010
Zusatzinfo VIII, 648 p.
Verlagsort New York, NY
Sprache englisch
Maße 160 x 240 mm
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Graphentheorie
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
ISBN-10 1-4419-4813-9 / 1441948139
ISBN-13 978-1-4419-4813-7 / 9781441948137
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95
Eine Einführung in die Systemtheorie

von Margot Berghaus

Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95