Cardinality constrained bin-packing problems
Year of publication: |
1999
|
---|---|
Authors: | Kellerer, H. ; Pferschy, U. |
Published in: |
Annals of operations research. - New York, NY [u.a.] : Springer Science + Business Media, ISSN 0254-5330, ZDB-ID 2526293. - Vol. 92.1999, p. 335-348
|
Saved in:
Saved in favorites
Similar items by person
-
Approximation algorithms for knapsack problems with cardinality constraints
Caprara, A., (2000)
-
Monge matrices make maximization manageable
Pferschy, U., (1994)
-
The inverse-parametric knapsack problem
Burkard, R.E., (1995)
- More ...