On Algorithms for Multidimensional Packing Problems and on the Complexity of higher dimensional Knapsack
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Kiel, Christian-Albrechts-Universität zu Kiel, Dissertation, 2024
- Keyword
-
Algorithmus
Online-Algorithmus
Kombinatorische Optimierung
Berechnungskomplexität
Approximationsalgorithmus
- Event
-
Veröffentlichung
- (where)
-
Kiel
- (who)
-
Universitätsbibliothek Kiel
- (when)
-
2024
- Creator
-
Grage, Kilian
- Contributor
- URN
-
urn:nbn:de:gbv:8:3-2024-01185-9
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:33 AM 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.
Associated
- Grage, Kilian
- Jansen, Klaus
- Megow, Nicole
- Universitätsbibliothek Kiel
Time of origin
- 2024
Other Objects (12)
On the complexity of anchored rectangle packing
On the Parameterized Complexity of Compact Set Packing
On Thc Computational Complexity of Facets of the Knapsack Problem
On the rectangular knapsack problem
Complexity of packing common bases in matroids
The Complexity of Packing Edge-Disjoint Paths
Scheduling and Packing Problems : Algorithms and Complexity
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
Drawer algorithms for 1-space bounded multidimensional hyperbox packing
On the complexity of anchored rectangle packing
On the Parameterized Complexity of Compact Set Packing
On Thc Computational Complexity of Facets of the Knapsack Problem
On the rectangular knapsack problem
Complexity of packing common bases in matroids
The Complexity of Packing Edge-Disjoint Paths
Scheduling and Packing Problems : Algorithms and Complexity
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
Drawer algorithms for 1-space bounded multidimensional hyperbox packing
On the complexity of anchored rectangle packing
On the Parameterized Complexity of Compact Set Packing
On Thc Computational Complexity of Facets of the Knapsack Problem
On the rectangular knapsack problem
Complexity of packing common bases in matroids
The Complexity of Packing Edge-Disjoint Paths
Scheduling and Packing Problems : Algorithms and Complexity
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem