Hochschulschrift
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
31 cm
- Umfang
-
189 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Paderborn, Univ., Diss., 2003
- Klassifikation
-
Mathematik
Informatik
- Schlagwort
-
Graph
Dekomposition
Untere Schranke
Mehrgüter-Fluss-Problem
Branch-and-Bound-Methode
- Urheber
-
Sensen, Norbert
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:15 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Sensen, Norbert
Ähnliche Objekte (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
Guaranteed lower bounds for eigenvalues
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
The exact distribution of the Hansen-Jagannathan bound
Resolution Lower Bounds for Refutation Statements
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness
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
Guaranteed lower bounds for eigenvalues
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
The exact distribution of the Hansen-Jagannathan bound
Resolution Lower Bounds for Refutation Statements
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness
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
Guaranteed lower bounds for eigenvalues
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
The exact distribution of the Hansen-Jagannathan bound
Resolution Lower Bounds for Refutation Statements
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension