Follow
Hans Kellerer
Hans Kellerer
Verified email at uni-graz.at
Title
Cited by
Cited by
Year
Multidimensional knapsack problems
H Kellerer, U Pferschy, D Pisinger, H Kellerer, U Pferschy, D Pisinger
Knapsack problems, 235-283, 2004
44592004
Approximation algorithms for knapsack problems with cardinality constraints
A Caprara, H Kellerer, U Pferschy, D Pisinger
European Journal of Operational Research 123 (2), 333-345, 2000
2402000
Selecting portfolios with fixed costs and minimum transaction lots
H Kellerer, R Mansini, MG Speranza
Annals of Operations Research 99, 287-304, 2000
2362000
Semi on-line algorithms for the partition problem
H Kellerer, V Kotov, MG Speranza, Z Tuza
Operations Research Letters 21 (5), 235-242, 1997
2321997
Introduction to NP-Completeness of knapsack problems
H Kellerer, U Pferschy, D Pisinger, H Kellerer, U Pferschy, D Pisinger
Knapsack problems, 483-493, 2004
2302004
Optimization of cardinality constrained portfolios with a hybrid local search algorithm
D Maringer, H Kellerer
Or Spectrum 25, 481-495, 2003
2262003
Approximability and nonapproximability results for minimizing total flow time on a single machine
H Kellerer, T Tautenhahn, GJ Woeginger
Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing …, 1996
1811996
Approximating multiobjective knapsack problems
T Erlebach, H Kellerer, U Pferschy
Management Science 48 (12), 1603-1612, 2002
1392002
An efficient fully polynomial approximation scheme for the subset-sum problem
H Kellerer, R Mansini, U Pferschy, MG Speranza
Journal of Computer and System Sciences 66 (2), 349-370, 2003
1272003
The multiple subset sum problem
A Caprara, H Kellerer, U Pferschy
SIAM Journal on Optimization 11 (2), 308-319, 2000
1262000
The multiple-choice knapsack problem
H Kellerer, U Pferschy, D Pisinger, H Kellerer, U Pferschy, D Pisinger
Knapsack problems, 317-347, 2004
1222004
Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
H Kellerer, VA Strusevich
Algorithmica 57, 769-795, 2010
1192010
Improved dynamic programming in connection with an FPTAS for the knapsack problem
H Kellerer, U Pferschy
Journal of Combinatorial Optimization 8, 5-11, 2004
1172004
A new fully polynomial time approximation scheme for the knapsack problem
H Kellerer, U Pferschy
Journal of Combinatorial Optimization 3, 59-71, 1999
1111999
The exact LPT-bound for maximizing the minimum completion time
J Csirik, H Kellerer, G Woeginger
Operations Research Letters 11 (5), 281-287, 1992
1061992
Parallel machine scheduling with job assignment restrictions
CA Glass, H Kellerer
Naval Research Logistics (NRL) 54 (3), 250-257, 2007
962007
Scheduling problems for parallel dedicated machines under multiple resource constraints
H Kellerer, VA Strusevich
Discrete Applied Mathematics 133 (1-3), 45-68, 2003
812003
Algorithms for on-line bin-packing problems with cardinality constraints
L Babel, B Chen, H Kellerer, V Kotov
Discrete Applied Mathematics 143 (1-3), 238-251, 2004
712004
A polynomial time approximation scheme for the multiple knapsack problem
H Kellerer
International Workshop on Randomization and Approximation Techniques in …, 1999
691999
Algorithms for multiprocessor scheduling with machine release times
H Kellerer
IIE transactions 30 (11), 991-999, 1998
691998
The system can't perform the operation now. Try again later.
Articles 1–20