- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: Conference record of the ... annual ACM Symposium on Theory of Computing. Washington, 1983, S. 70-79
- Classification
-
Allgemeines, Wissenschaft
- Event
-
Veröffentlichung
- (where)
-
Paderborn
- (who)
-
Universitätsbibliothek
- (when)
-
1983
- Creator
- URN
-
urn:nbn:de:hbz:466:2-6191
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:47 PM CET
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
- 1983
Other Objects (12)
A polynomial linear search algorithm for the N-dimensional Knapsack problem
No polynomial kernels for knapsack
A polynomial upper bound for a mutation based algorithm on the two-dimensional Ising model
A polynomial-time parsing algorithm for TT-MCTAG
Towards a Genuinely Polynomial Algorithm for Linear Programming
A genetic algorithm for the twodimensional Knapsack problem with rectangular pieces
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
A Relaxation Algorithm for a Class of Decomposable Polynomial Programming Problems
A polynomial algorithm for a NP-hard to solve optimization problem
"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
A polynomial linear search algorithm for the N-dimensional Knapsack problem
No polynomial kernels for knapsack
A polynomial upper bound for a mutation based algorithm on the two-dimensional Ising model
A polynomial-time parsing algorithm for TT-MCTAG
Towards a Genuinely Polynomial Algorithm for Linear Programming
A genetic algorithm for the twodimensional Knapsack problem with rectangular pieces
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
A Relaxation Algorithm for a Class of Decomposable Polynomial Programming Problems
A polynomial algorithm for a NP-hard to solve optimization problem
"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
A polynomial linear search algorithm for the N-dimensional Knapsack problem
No polynomial kernels for knapsack
A polynomial upper bound for a mutation based algorithm on the two-dimensional Ising model
A polynomial-time parsing algorithm for TT-MCTAG
Towards a Genuinely Polynomial Algorithm for Linear Programming
A genetic algorithm for the twodimensional Knapsack problem with rectangular pieces
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
A Relaxation Algorithm for a Class of Decomposable Polynomial Programming Problems
A polynomial algorithm for a NP-hard to solve optimization problem
"A.Y.H. Knapsack"
An Optimal Algorithm for Online Multiple Knapsack: Q/A Session A - Paper A2.B