zum Inhalt wechseln
Combinatorial optimization : algorithms and complexity Titelvorschau
SchließenTitelvorschau
Prüfung…

Combinatorial optimization : algorithms and complexity

Verfasser/in: Christos H Papadimitriou; Kenneth Steiglitz
Verlag: Englewood Cliffs, N.J. : Prentice Hall, ©1982.
Ausgabe/Format   Buch : EnglischAlle Ausgaben und Formate anzeigen
Datenbank:WorldCat
Zusammenfassung:
Christos H. Papadimitriou and Kenneth Steiglitz have combined the theory of computational complexity developed by computer scientists, and the foundations of mathematical programming developed by the operations research community. This text will be useful to students with a wide range of backgrounds, including computer science, operations research, and electrical engineering.
Bewertung:

(noch nicht bewertet) 0 mit Rezensionen - Verfassen Sie als Erste eine Rezension.

Themen
Ähnliche Titel

 

Exemplar ausleihen

&AllPage.SpinnerRetrieving; Suche nach Bibliotheken, die diesen Titel besitzen ...

Details

Physisches Format Online version:
Papadimitriou, Christos H.
Combinatorial optimization.
Englewood Cliffs, N.J. : Prentice Hall, ©1982
(OCoLC)558516482
Dokumenttyp: Buch
Alle Autoren: Christos H Papadimitriou; Kenneth Steiglitz
ISBN: 0131524623 9780131524620 0486402584 9780486402581
OCLC-Nummer: 7463296
Beschreibung: xvi, 496 pages : illustrations ; 24 cm
Inhalt: Optimization problems --
The simplex algorithm --
Duality --
computational considerations for the simplex algorithm --
The primal-dual algorithm --
Primal-dual algorithms for max-flow and shortest path: Ford-Fulkerson and Dijkstra --
Primal-dual algorithms for min-cost flow --
Algorithms and complexity --
Efficient algorithms for the max-flow problem --
Algorithms for matching --
Weighted matching --
Spanning trees and matroids --
Integer linear programming --
A cutting-lane algorithm for integer linear programs --
NP-complete problems --
More about NP-completeness --
Approximation algorithms --
Branch-and-bound and dynamic programming --
Local search.
Verfasserangabe: Christos H. Papadimitriou, Kenneth Steiglitz.

Abstract:

Christos H. Papadimitriou and Kenneth Steiglitz have combined the theory of computational complexity developed by computer scientists, and the foundations of mathematical programming developed by the operations research community. This text will be useful to students with a wide range of backgrounds, including computer science, operations research, and electrical engineering.

Rezensionen

Nutzer-Rezensionen
Suche nach GoodReads-Rezensionen
Suche nach DOGObooks-Rezensionen…

Tags

Tragen Sie als Erste Tags ein.
Anfrage bestätigen

Sie haben diesen Titel bereits angefordert. Wenn Sie trotzdem fortfahren möchten, klicken Sie auf OK.

Verlinkung


<http://www.worldcat.org/oclc/7463296>
library:oclcnum"7463296"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/7463296>
rdf:typeschema:Book
schema:about
<http://experiment.worldcat.org/entity/work/data/478349163#Topic/optimisation_mathematique>
rdf:typeschema:Intangible
schema:name"Optimisation mathématique."@en
schema:name"Optimisation mathématique."@fr
schema:name"optimisation mathématique."@en
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:copyrightYear"1982"
schema:creator
schema:datePublished"1982"
schema:description"Optimization problems -- The simplex algorithm -- Duality -- computational considerations for the simplex algorithm -- The primal-dual algorithm -- Primal-dual algorithms for max-flow and shortest path: Ford-Fulkerson and Dijkstra -- Primal-dual algorithms for min-cost flow -- Algorithms and complexity -- Efficient algorithms for the max-flow problem -- Algorithms for matching -- Weighted matching -- Spanning trees and matroids -- Integer linear programming -- A cutting-lane algorithm for integer linear programs -- NP-complete problems -- More about NP-completeness -- Approximation algorithms -- Branch-and-bound and dynamic programming -- Local search."@en
schema:description"Christos H. Papadimitriou and Kenneth Steiglitz have combined the theory of computational complexity developed by computer scientists, and the foundations of mathematical programming developed by the operations research community. This text will be useful to students with a wide range of backgrounds, including computer science, operations research, and electrical engineering."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/478349163>
schema:inLanguage"en"
schema:name"Combinatorial optimization : algorithms and complexity"@en
schema:publisher
schema:url
schema:workExample
schema:workExample

Content-negotiable representations

Fenster schließen

Bitte in WorldCat einloggen 

Sie haben kein Konto? Sie können sehr einfach ein kostenloses Konto anlegen,.