Hochschulschrift
Hybrid genetic algorithms for solving constrained packing and placement problems
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
21 cm
- Umfang
-
113 S.
- Sprache
-
Englisch
- Anmerkungen
-
Ill., graph. Darst.
Osnabrück, Univ., Diss., 1996
- Schlagwort
-
VLSI
Packungsproblem
Platzierung
Genetischer Algorithmus
Paralleler Algorithmus
- Urheber
-
Schnecke, Volker
- 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:12 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
- Schnecke, Volker
Ähnliche Objekte (12)
Approximation algorithms for linear programs and geometrically constrained packing roblems
Algorithms for packing problems
Algorithms for Packing Problems
Approximation algorithms for geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Algorithms for geometric packing and scaling problems
Packing grid figures : exact algorithms and heuristics
Approximation algorithms for packing and scheduling problems
Scheduling and Packing Problems : Algorithms and Complexity
Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis
Approximation algorithms for linear programs and geometrically constrained packing roblems
Algorithms for packing problems
Algorithms for Packing Problems
Approximation algorithms for geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Algorithms for geometric packing and scaling problems
Packing grid figures : exact algorithms and heuristics
Approximation algorithms for packing and scheduling problems
Scheduling and Packing Problems : Algorithms and Complexity
Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis
Approximation algorithms for linear programs and geometrically constrained packing roblems
Algorithms for packing problems
Algorithms for Packing Problems
Approximation algorithms for geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Algorithms for geometric packing and scaling problems
Packing grid figures : exact algorithms and heuristics
Approximation algorithms for packing and scheduling problems
Scheduling and Packing Problems : Algorithms and Complexity