The Resource Combinatorial optimization : algorithms and complexity, Christos H. Papadimitriou, Kenneth Steiglitz
Combinatorial optimization : algorithms and complexity, Christos H. Papadimitriou, Kenneth Steiglitz
Resource Information
The item Combinatorial optimization : algorithms and complexity, Christos H. Papadimitriou, Kenneth Steiglitz represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Combinatorial optimization : algorithms and complexity, Christos H. Papadimitriou, Kenneth Steiglitz represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
- Summary
- 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
- Language
- eng
- Extent
- xvi, 496 pages
- Contents
-
- 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
- Isbn
- 9780131524620
- Label
- Combinatorial optimization : algorithms and complexity
- Title
- Combinatorial optimization
- Title remainder
- algorithms and complexity
- Statement of responsibility
- Christos H. Papadimitriou, Kenneth Steiglitz
- Subject
-
- Combinatorial optimization
- Complexité de calcul (Informatique)
- Complexité de calcul (informatique)
- Computational complexity
- Kombinatorik
- Kombinatorische Optimierung
- Mathematical optimization
- Optimierung
- Optimisation combinatoire
- Optimisation mathématique
- Optimisation mathématique
- algorithme approximation
- algorithme simplexe
- analyse combinatoire
- complexité calcul
- dualité
- matroïde
- optimisation mathématique
- programmation dynamique
- programmation linéaire
- Analyse combinatoire
- Language
- eng
- Summary
- 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
- Cataloging source
- DLC
- http://library.link/vocab/creatorName
- Papadimitriou, Christos H
- Dewey number
-
- 511/.6
- 519
- Illustrations
- illustrations
- Index
- index present
- LC call number
- QA402.5
- LC item number
- .P37
- Literary form
- non fiction
- Nature of contents
- bibliography
- http://library.link/vocab/relatedWorkOrContributorDate
- 1939-
- http://library.link/vocab/relatedWorkOrContributorName
- Steiglitz, Kenneth
- http://library.link/vocab/subjectName
-
- Mathematical optimization
- Combinatorial optimization
- Computational complexity
- matroïde
- programmation linéaire
- dualité
- programmation dynamique
- algorithme approximation
- algorithme simplexe
- complexité calcul
- analyse combinatoire
- optimisation mathématique
- Optimisation mathématique
- Analyse combinatoire
- Complexité de calcul (Informatique)
- Optimisation mathématique
- Optimisation combinatoire
- Complexité de calcul (informatique)
- Kombinatorik
- Kombinatorische Optimierung
- Optimierung
- Label
- Combinatorial optimization : algorithms and complexity, Christos H. Papadimitriou, Kenneth Steiglitz
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- 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
- Control code
- 7463296
- Dimensions
- 24 cm
- Extent
- xvi, 496 pages
- Isbn
- 9780131524620
- Lccn
- 81005866
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
-
- n
- Other physical details
- illustrations
- System control number
- (OCoLC)7463296
- Label
- Combinatorial optimization : algorithms and complexity, Christos H. Papadimitriou, Kenneth Steiglitz
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- 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
- Control code
- 7463296
- Dimensions
- 24 cm
- Extent
- xvi, 496 pages
- Isbn
- 9780131524620
- Lccn
- 81005866
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
-
- n
- Other physical details
- illustrations
- System control number
- (OCoLC)7463296
Subject
- Combinatorial optimization
- Complexité de calcul (Informatique)
- Complexité de calcul (informatique)
- Computational complexity
- Kombinatorik
- Kombinatorische Optimierung
- Mathematical optimization
- Optimierung
- Optimisation combinatoire
- Optimisation mathématique
- Optimisation mathématique
- algorithme approximation
- algorithme simplexe
- analyse combinatoire
- complexité calcul
- dualité
- matroïde
- optimisation mathématique
- programmation dynamique
- programmation linéaire
- Analyse combinatoire
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Combinatorial-optimization--algorithms-and/Am9XVPUBYDU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Combinatorial-optimization--algorithms-and/Am9XVPUBYDU/">Combinatorial optimization : algorithms and complexity, Christos H. Papadimitriou, Kenneth Steiglitz</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Combinatorial optimization : algorithms and complexity, Christos H. Papadimitriou, Kenneth Steiglitz
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Combinatorial-optimization--algorithms-and/Am9XVPUBYDU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Combinatorial-optimization--algorithms-and/Am9XVPUBYDU/">Combinatorial optimization : algorithms and complexity, Christos H. Papadimitriou, Kenneth Steiglitz</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
