Hochschulschrift
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
31 cm
- Extent
-
189 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Paderborn, Univ., Diss., 2003
- Classification
-
Mathematik
Informatik
- Keyword
-
Graph
Dekomposition
Untere Schranke
Mehrgüter-Fluss-Problem
Branch-and-Bound-Methode
- Creator
-
Sensen, Norbert
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 11:46 AM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Sensen, Norbert
Other Objects (12)
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Single source unsplittable flows with arc-wise lower and upper bounds
Locally Exact Lower Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints
Exact BPS bound for noncommutative baby Skyrmions
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
The exact distribution of the Hansen-Jagannathan bound
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness
Inferring Lower Bounds for Runtime Complexity
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Single source unsplittable flows with arc-wise lower and upper bounds
Locally Exact Lower Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints
Exact BPS bound for noncommutative baby Skyrmions
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
The exact distribution of the Hansen-Jagannathan bound
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness
Inferring Lower Bounds for Runtime Complexity
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Single source unsplittable flows with arc-wise lower and upper bounds
Locally Exact Lower Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints
Exact BPS bound for noncommutative baby Skyrmions
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
The exact distribution of the Hansen-Jagannathan bound
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness