Hochschulschrift
Performance of heuristics for higher-dimensional packing problems
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
174 Seiten
- Sprache
-
Englisch
- Anmerkungen
-
Illustrationen
Technische Universität Dresden, Dissertation, 2021
- Klassifikation
-
Mathematik
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.03.2025, 12:23 MEZ
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
Entstanden
- [2021?]
Ähnliche Objekte (12)
One-dimensional approaches and relaxations for higher-dimensional orthogonal packing
Packing grid figures : exact algorithms and heuristics
Exact Approaches for Higher-Dimensional Orthogonal Packing and Related Problems
Exact approaches for higher-dimensional orthogonal packing and related problems
Two-dimensional packing problems
New approximability results for two-dimensional bin packing
The two dimensional bin packing problem with side constraints
Approximation algorithms for scheduling and two-dimensional packing problems
Assessing performance of container slot allocation heuristics
Assessing performance of container slot allocation heuristics
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
One-dimensional approaches and relaxations for higher-dimensional orthogonal packing
Packing grid figures : exact algorithms and heuristics
Exact Approaches for Higher-Dimensional Orthogonal Packing and Related Problems
Exact approaches for higher-dimensional orthogonal packing and related problems
Two-dimensional packing problems
New approximability results for two-dimensional bin packing
The two dimensional bin packing problem with side constraints
Approximation algorithms for scheduling and two-dimensional packing problems
Assessing performance of container slot allocation heuristics
Assessing performance of container slot allocation heuristics
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
One-dimensional approaches and relaxations for higher-dimensional orthogonal packing
Packing grid figures : exact algorithms and heuristics
Exact Approaches for Higher-Dimensional Orthogonal Packing and Related Problems
Exact approaches for higher-dimensional orthogonal packing and related problems
Two-dimensional packing problems
New approximability results for two-dimensional bin packing
The two dimensional bin packing problem with side constraints
Approximation algorithms for scheduling and two-dimensional packing problems
Assessing performance of container slot allocation heuristics
Assessing performance of container slot allocation heuristics
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems