Hochschulschrift
Relaxations and solutions for the minimum graph bisection problem
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783832517359
3832517359
- Dimensions
-
21 cm
- Extent
-
II, 226 S.
- Language
-
Englisch
- Notes
-
Ill., graph. Darst.
Zugl.: Darmstadt, Techn. Univ., Diss., 2007
- Keyword
-
Bisektionsproblem
Branch-and-Cut-Methode
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:38 PM CEST
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
- Fügenschuh, Marzena
- Logos-Verl.
Time of origin
- 2007
Other Objects (12)
Representations, hierarchies and graphs of institutions
Strong Lp-solutions for fluid-rigid body interaction problems
Protein folding and self-avoiding walks polyhedral studies and solutions
Distributed memetic algorithms for graph theoretical combinatorial optimization problems
Static and dynamic graph partitioning : a comparative study of existing algorithms
An integrated operational semantics for a UML core based on graph transformation
Iterative approximation of the positive solutions of a class of nonlinear Volterra type integral equations
Schriften zum Software-Qualitätsmanagement, [...]. Erfahrungs- und Forschungsberichte
Proceedings of software engineering and quality assurance, 1
Theorie und Praxis in den Arbeitsfeldern der sozialen Arbeit, 1
Záhyby reči : nová rakúska lyrika = Sprachfalten
Entwicklungsmethoden und Entwicklungsprozesse im Maschinenbau, Tagungsbd. 1
Representations, hierarchies and graphs of institutions
Strong Lp-solutions for fluid-rigid body interaction problems
Protein folding and self-avoiding walks polyhedral studies and solutions
Distributed memetic algorithms for graph theoretical combinatorial optimization problems
Static and dynamic graph partitioning : a comparative study of existing algorithms
An integrated operational semantics for a UML core based on graph transformation
Iterative approximation of the positive solutions of a class of nonlinear Volterra type integral equations
Schriften zum Software-Qualitätsmanagement, [...]. Erfahrungs- und Forschungsberichte
Proceedings of software engineering and quality assurance, 1
Theorie und Praxis in den Arbeitsfeldern der sozialen Arbeit, 1
Záhyby reči : nová rakúska lyrika = Sprachfalten
Entwicklungsmethoden und Entwicklungsprozesse im Maschinenbau, Tagungsbd. 1
Representations, hierarchies and graphs of institutions
Strong Lp-solutions for fluid-rigid body interaction problems
Protein folding and self-avoiding walks polyhedral studies and solutions
Distributed memetic algorithms for graph theoretical combinatorial optimization problems
Static and dynamic graph partitioning : a comparative study of existing algorithms
An integrated operational semantics for a UML core based on graph transformation
Iterative approximation of the positive solutions of a class of nonlinear Volterra type integral equations
Schriften zum Software-Qualitätsmanagement, [...]. Erfahrungs- und Forschungsberichte
Proceedings of software engineering and quality assurance, 1
Theorie und Praxis in den Arbeitsfeldern der sozialen Arbeit, 1
Záhyby reči : nová rakúska lyrika = Sprachfalten