Hans Kellerer
Hans Kellerer
Bestätigte E-Mail-Adresse bei uni-graz.at
Titel
Zitiert von
Zitiert von
Jahr
Multidimensional knapsack problems
H Kellerer, U Pferschy, D Pisinger
Knapsack problems, 235-283, 2004
35822004
Selecting portfolios with fixed costs and minimum transaction lots
H Kellerer, R Mansini, MG Speranza
Annals of Operations Research 99 (1-4), 287-304, 2000
2102000
Optimization of cardinality constrained portfolios with a hybrid local search algorithm
D Maringer, H Kellerer
Or Spectrum 25 (4), 481-495, 2003
2042003
Semi on-line algorithms for the partition problem
H Kellerer, V Kotov, MG Speranza, Z Tuza
Operations Research Letters 21 (5), 235-242, 1997
2041997
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
1972000
Approximability and nonapproximability results for minimizing total flow time on a single machine
H Kellerer, T Tautenhahn, G Woeginger
SIAM Journal on Computing 28 (4), 1155-1166, 1999
1631999
Approximating multiobjective knapsack problems
T Erlebach, H Kellerer, U Pferschy
Management Science 48 (12), 1603-1612, 2002
1112002
A new fully polynomial time approximation scheme for the knapsack problem
H Kellerer, U Pferschy
Journal of Combinatorial Optimization 3 (1), 59-71, 1999
981999
Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
H Kellerer, VA Strusevich
Algorithmica 57 (4), 769-795, 2010
972010
The multiple subset sum problem
A Caprara, H Kellerer, U Pferschy
SIAM Journal on Optimization 11 (2), 308-319, 2000
902000
The exact LPT-bound for maximizing the minimum completion time
J Csirik, H Kellerer, G Woeginger
Operations Research Letters 11 (5), 281-287, 1992
881992
Improved dynamic programming in connection with an FPTAS for the knapsack problem
H Kellerer, U Pferschy
Journal of Combinatorial Optimization 8 (1), 5-11, 2004
852004
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
772003
Parallel machine scheduling with job assignment restrictions
CA Glass, H Kellerer
Naval Research Logistics (NRL) 54 (3), 250-257, 2007
762007
Scheduling problems for parallel dedicated machines under multiple resource constraints
H Kellerer, VA Strusevich
Discrete Applied Mathematics 133 (1-3), 45-68, 2003
642003
Algorithms for multiprocessor scheduling with machine release times
H Kellerer
IIE transactions 30 (11), 991-999, 1998
631998
Scheduling parallel dedicated machines under a single non-shared resource
H Kellerer, VA Strusevich
European Journal of Operational Research 147 (2), 345-364, 2003
552003
A polynomial time approximation scheme for the multiple knapsack problem
H Kellerer
Randomization, Approximation, and Combinatorial Optimization. Algorithms and …, 1999
551999
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
542004
Approximation schemes for ordered vector packing problems
A Caprara, H Kellerer, U Pferschy
Naval Research Logistics (NRL) 50 (1), 58-69, 2003
522003
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20