doorgaan naar inhoud
Combinatorial optimization : algorithms and complexity Voorbeeldweergave van dit item
SluitenVoorbeeldweergave van dit item
Bezig met controle...

Combinatorial optimization : algorithms and complexity

Auteur: Christos H Papadimitriou; Kenneth Steiglitz
Uitgever: Englewood Cliffs, N.J. : Prentice Hall, ©1982.
Editie/Formaat:   Boek : EngelsAlle edities en materiaalsoorten bekijken.
Database:WorldCat
Samenvatting:
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.
Beoordeling:

(nog niet beoordeeld) 0 met beoordelingen - U bent de eerste

Onderwerpen
Meer in deze trant

 

Zoeken naar een in de bibliotheek beschikbaar exemplaar

&AllPage.SpinnerRetrieving; Bibliotheken met dit item worden gezocht…

Details

Aanvullende fysieke materiaalsoort: Online version:
Papadimitriou, Christos H.
Combinatorial optimization.
Englewood Cliffs, N.J. : Prentice Hall, c1982
(OCoLC)558516482
Soort document: Boek
Alle auteurs / medewerkers: Christos H Papadimitriou; Kenneth Steiglitz
ISBN: 0131524623 9780131524620 0486402584 9780486402581
OCLC-nummer: 7463296
Beschrijving: xvi, 496 p. : ill. ; 24 cm.
Inhoud: 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.
Verantwoordelijkheid: Christos H. Papadimitriou, Kenneth Steiglitz.

Fragment:

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.

Beoordelingen

Beoordelingen door gebruikers
Beoordelingen van GoodReads worden opgehaald...
Bezig met opvragen DOGObooks-reviews...

Tags

U bent de eerste.
Bevestig deze aanvraag

Misschien heeft u dit item reeds aangevraagd. Selecteer a.u.b. Ok als u toch wilt doorgaan met deze aanvraag.

Gekoppelde data


<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
<http://id.worldcat.org/fast/868980>
rdf:typeschema:Intangible
schema:name"Combinatorial optimization"@en
schema:name"Combinatorial optimization."@en
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/1012099>
rdf:typeschema:Intangible
schema:name"Mathematical optimization"@en
schema:name"Mathematical optimization."@en
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/871991>
rdf:typeschema:Intangible
schema:name"Computational complexity"@en
schema:name"Computational complexity."@en
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:numberOfPages"496"
schema:publisher
schema:url
schema:workExample
schema:workExample

Content-negotiable representations

Venster sluiten

Meld u aan bij WorldCat 

Heeft u geen account? U kunt eenvoudig een nieuwe gratis account aanmaken.