Close
Publizieren
Besondere Sammlungen
Digitalisierungsservice
Hilfe
Impressum
Datenschutz
jump to main content
Search Details
Quicksearch:
OK
Result-List
Title
Title
Content
Content
Page
Page
Search Book
The search-operation requires javascript to be activated.
The search-operation requires javascript to be activated.
The search-operation requires javascript to be activated.
Bibliographic Metadata
Title
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
:
/ von Norbert Sensen
Author
Sensen, Norbert
Published
2003
Institutional Note
Paderborn, Univ., Diss., 2003
Language
English
Document Types
Dissertation (PhD)
Keywords (GND)
Graph
/
Dekomposition
/
Untere Schranke
/
Mehrgüter-Fluss-Problem
/
Branch-and-Bound-Methode
URN
urn:nbn:de:hbz:466-20030101341
Links
Social Media
Share
Reference
Universitätsbibliothek Paderborn
IIIF
IIIF Manifest
Files
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
[
pdf
0.96 mb
]
zusfasng
[
pdf
40.42 kb
]
abstract
[
pdf
36.4 kb
]
RIS
Classification
Besondere Sammlungen
→
Veröffentlichungen der Universität
→
Fakultät für Elektrotechnik, Informatik und Mathematik
→
Institut für Informatik
Content
Contents of this Book
Stats
The PDF-Document has been downloaded
343
times.
License/Rightsstatement
In Copyright
The search-operation requires javascript to be activated.
