- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Journal of the Association for Computing Machinery Jg. 1984 (1984), S. 668-676
- Classification
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
Paderborn
- (who)
-
Universitätsbibliothek
- (when)
-
1984
- Creator
- URN
-
urn:nbn:de:hbz:466:2-5921
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:46 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
- Meyer auf der Heide, Friedhelm
- Universitätsbibliothek
Time of origin
- 1984
Other Objects (12)
A polynomial linear search algorithm for the N-dimensional Knapsack problem
No polynomial kernels for knapsack
A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
An Improved Approximation Algorithm for Knapsack Median Using Sparsification
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
Polynomial whitening for high-dimensional data
New binary bat algorithm for solving 0–1 knapsack problem
A polynomial upper bound for a mutation based algorithm on the two-dimensional Ising model
"A.Y.H. Knapsack"
A genetic algorithm for the twodimensional Knapsack problem with rectangular pieces
Gene Silencing Genetic Algorithm for 0/1 Knapsack with Object Preferences
A polynomial linear search algorithm for the N-dimensional Knapsack problem
No polynomial kernels for knapsack
A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
An Improved Approximation Algorithm for Knapsack Median Using Sparsification
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
Polynomial whitening for high-dimensional data
New binary bat algorithm for solving 0–1 knapsack problem
A polynomial upper bound for a mutation based algorithm on the two-dimensional Ising model
"A.Y.H. Knapsack"
A genetic algorithm for the twodimensional Knapsack problem with rectangular pieces
Gene Silencing Genetic Algorithm for 0/1 Knapsack with Object Preferences
A polynomial linear search algorithm for the N-dimensional Knapsack problem
No polynomial kernels for knapsack
A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
An Improved Approximation Algorithm for Knapsack Median Using Sparsification
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
Polynomial whitening for high-dimensional data
New binary bat algorithm for solving 0–1 knapsack problem
A polynomial upper bound for a mutation based algorithm on the two-dimensional Ising model
"A.Y.H. Knapsack"
A genetic algorithm for the twodimensional Knapsack problem with rectangular pieces