Verwandte Artikel zu Handbook of Combinatorial Optimization: Supplement...
Inhaltsangabe
Preface - Data Correcting Algorithms in Combinatorial Optimization - The Steiner Ratio of Banach-Minkowski Space - Probabilistic Verification and Non-Approximability - Steiner Trees in Industry - Network-Based Model and Algorithms in Data Mining and Knowledge Discovery - The Generalized Assignment Problem and Extensions - Optimal Rectangular Partitions - Connected Dominating Sets in Sensor Networks and MANETs - Author Index - Subject Index
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Von der hinteren Coverseite
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 136,16
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Handbook of Combinatorial Optimization: Supplement...
Foto des Verkäufers
Handbook of Combinatorial Optimization
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 problemsThe material presented in this supplement to the 3-volume . Bestandsnummer des Verkäufers 4174072
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Handbook of Combinatorial Optimization
Verlag:
Springer US, Springer US Apr 2011, 2011
ISBN 10: 1441936661
ISBN 13: 9781441936660
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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).Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 404 pp. Englisch. Bestandsnummer des Verkäufers 9781441936660
Anzahl: 1 verfügbar
Foto des Verkäufers
Handbook of Combinatorial Optimization
Print-on-DemandAnbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimizationset. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way. 404 pp. Englisch. Bestandsnummer des Verkäufers 9781441936660
Anzahl: 2 verfügbar
Foto des Verkäufers
Handbook of Combinatorial Optimization : Supplement Volume B
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. 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 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). Bestandsnummer des Verkäufers 9781441936660
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Handbook of Combinatorial Optimization: Supplement Volume B
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar2411530295190
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Handbook of Combinatorial Optimization
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 404. Bestandsnummer des Verkäufers 263064243
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Handbook of Combinatorial Optimization: Supplement Volume B
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9781441936660_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Handbook of Combinatorial Optimization
Print-on-DemandAnbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. PRINT ON DEMAND pp. 404. Bestandsnummer des Verkäufers 183064249
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Handbook of Combinatorial Optimization
Print-on-DemandAnbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Print on Demand pp. 404 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Bestandsnummer des Verkäufers 5865068
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Handbook of Combinatorial Optimization: Supplement Volume B
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Brand New. supplement edition. 408 pages. 9.61x6.61x1.97 inches. In Stock. Bestandsnummer des Verkäufers x-1441936661
Anzahl: 2 verfügbar