A genetic algorithm for the twodimensional Knapsack problem with rectangular pieces
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Diskussionsbeiträge der Fakultät für Wirtschaftswissenschaft der FernUniversität in Hagen ; 425
- Klassifikation
-
Politik
- Ereignis
-
Veröffentlichung
- (wo)
-
Hagen
- (wer)
-
FernUniversität in Hagen
- (wann)
-
2008
- Urheber
- URN
-
urn:nbn:de:hbz:708-dh3873
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:54 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.
Beteiligte
- Bortfeldt, Andreas
- Winter, Tobias
- FernUniversität in Hagen
Entstanden
- 2008
Ähnliche Objekte (12)
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
The two-dimensional, rectangular, guillotineable-layout cutting problem with defects
The two-dimensional, rectangular, guillotineable layout cutting problem with single defect
A polynomial linear search algorithm for the N-dimensional Knapsack problem
A polynomial linear search algorithm for the N-dimensional Knapsack problem
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
A constraint programming approach for the two-dimensional rectangular packing problem with orthogonal orientations
"A.Y.H. Knapsack"
An Optimal Algorithm for Online Multiple Knapsack: Q/A Session A - Paper A2.B
A new exact algorithm to solve the Multiple-Choice Multidimensional Knapsack Problem: The Utility Sorted Branch and Bound Algorithm
Calibrating Depth Sensors with a Genetic Algorithm
Genetic Optimization Algorithm for Metabolic Engineering Revisited
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
The two-dimensional, rectangular, guillotineable-layout cutting problem with defects
The two-dimensional, rectangular, guillotineable layout cutting problem with single defect
A polynomial linear search algorithm for the N-dimensional Knapsack problem
A polynomial linear search algorithm for the N-dimensional Knapsack problem
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
A constraint programming approach for the two-dimensional rectangular packing problem with orthogonal orientations
"A.Y.H. Knapsack"
An Optimal Algorithm for Online Multiple Knapsack: Q/A Session A - Paper A2.B
A new exact algorithm to solve the Multiple-Choice Multidimensional Knapsack Problem: The Utility Sorted Branch and Bound Algorithm
Calibrating Depth Sensors with a Genetic Algorithm
Genetic Optimization Algorithm for Metabolic Engineering Revisited
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
The two-dimensional, rectangular, guillotineable-layout cutting problem with defects
The two-dimensional, rectangular, guillotineable layout cutting problem with single defect
A polynomial linear search algorithm for the N-dimensional Knapsack problem
A polynomial linear search algorithm for the N-dimensional Knapsack problem
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
A constraint programming approach for the two-dimensional rectangular packing problem with orthogonal orientations
"A.Y.H. Knapsack"
An Optimal Algorithm for Online Multiple Knapsack: Q/A Session A - Paper A2.B
A new exact algorithm to solve the Multiple-Choice Multidimensional Knapsack Problem: The Utility Sorted Branch and Bound Algorithm
Calibrating Depth Sensors with a Genetic Algorithm