Hans Kellerer

Hans Kellerer, Vitaly A. Strusevich: Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product. European Journal of Operational Research 228(1): 24-32 (2013)

Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich: Preemptive scheduling on two identical parallel machines with a single transporter. J. Comb. Optim. 25(2): 279-307 (2013)

Hans Kellerer, Vitaly A. Strusevich: The symmetric quadratic knapsack problem: approximation and scheduling applications. 4OR 10(2): 111-161 (2012)

Alessandro Agnetis, Hans Kellerer, Gaia Nicosia, Andrea Pacifici: Parallel dedicated machines scheduling with chain precedence constraints. European Journal of Operational Research 221(2): 296-305 (2012)

T. C. E. Cheng, Hans Kellerer, Vladimir Kotov: Algorithms better than LPT for semi-online scheduling with decreasing processing times. Oper. Res. Lett. 40(5): 349-352 (2012)

Alessandro Agnetis, Hans Kellerer, Gaia Nicosia, Andrea Pacifici: Scheduling Two Chains on Parallel Dedicated Machines. CTW 2012: 9-12

Imed Kacem, Hans Kellerer: Foreword: Combinatorial optimization for industrial engineering. Computers & Industrial Engineering 61(2): 239-241 (2011)

Konstantin Chakhlevitch, Celia A. Glass, Hans Kellerer: Batch machine production with perishability time windows and limited batch size. European Journal of Operational Research 210(1): 39-47 (2011)

Hans Kellerer, Vladimir Kotov: A 3/2-approximation algorithm for 3/2-partitioning. Oper. Res. Lett. 39(5): 359-362 (2011)

Imed Kacem, Hans Kellerer: Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. J. Scheduling 14(3): 257-265 (2011)

Hans Kellerer, Vitaly A. Strusevich: Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications. Algorithmica 57(4): 769-795 (2010)

Hans Kellerer, Vitaly A. Strusevich: Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack. Int. J. Found. Comput. Sci. 21(3): 357-383 (2010)

Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich: Transporting Jobs through a Processing Center with Two Parallel Machines. COCOA (1) 2010: 408-422

Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich: Operator non-availability periods. 4OR 7(3): 239-253 (2009)

Hans Kellerer, Mikhail A. Kubzin, Vitaly A. Strusevich: Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. European Journal of Operational Research 199(1): 111-116 (2009)

Hans Kellerer: An approximation algorithm for identical parallel machine scheduling with resource dependent processing times. Oper. Res. Lett. 36(2): 157-159 (2008)

Hans Kellerer: Knapsack. Encyclopedia of Algorithms 2008

Hans Kellerer, Vitaly A. Strusevich: A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theor. Comput. Sci. 369(1-3): 230-238 (2006)

T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov: Semi-on-line multiprocessor scheduling with given total processing time. Theor. Comput. Sci. 337(1-3): 134-146 (2005)

Hans Kellerer, Ulrich Pferschy, David Pisinger: Knapsack problems. Springer 2004, isbn 978-3-540-40286-2, pp. I-XX, 1-546

Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov: Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Applied Mathematics 143(1-3): 238-251 (2004)

Hans Kellerer, Ulrich Pferschy: Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. J. Comb. Optim. 8(1): 5-11 (2004)

Hans Kellerer, Vitaly A. Strusevich: Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics 133(1-3): 45-68 (2003)

Hans Kellerer, Vitaly A. Strusevich: Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research 147(2): 345-364 (2003)

Alberto Caprara, Hans Kellerer, Ulrich Pferschy: A 3/4-Approximation Algorithm for Multiple Subset Sum. J. Heuristics 9(2): 99-111 (2003)

Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza: An efficient fully polynomial approximation scheme for the Subset-Sum Problem. J. Comput. Syst. Sci. 66(2): 349-370 (2003)

Luitpold Babel, Hans Kellerer: Design of tariff zones in public transportation networks: theoretical results and heuristics. Math. Meth. of OR 58(3): 359-374 (2003)

Hans Kellerer, Vladimir Kotov: An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. Oper. Res. Lett. 31(1): 35-41 (2003)

Peter Greistorfer, Hans Kellerer: Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem. J. Heuristics 7(4): 371-390 (2001)

Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov: On-Line Algorithms for Cardinality Constrained Bin Packing Problems. ISAAC 2001: 695-706

Alberto Caprara, Hans Kellerer, Ulrich Pferschy: Approximation Schemes for Ordered Vector Packing Problems. RANDOM-APPROX 2001: 63-74

Thomas Erlebach, Hans Kellerer, Ulrich Pferschy: Approximating Multi-objective Knapsack Problems. WADS 2001: 210-221

Hans Kellerer, Renata Mansini, Maria Grazia Speranza: Two linear approximation algorithms for the subset-sum problem. European Journal of Operational Research 120(2): 289-296 (2000)

Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger: Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research 123(2): 333-345 (2000)

Alberto Caprara, Hans Kellerer, Ulrich Pferschy: A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. Inf. Process. Lett. 73(3-4): 111-118 (2000)

József Békési, Gábor Galambos, Hans Kellerer: A 5/4 Linear Time Bin Packing Algorithm. J. Comput. Syst. Sci. 60(1): 145-160 (2000)

Alberto Caprara, Hans Kellerer, Ulrich Pferschy: The Multiple Subset Sum Problem. SIAM Journal on Optimization 11(2): 308-319 (2000)

Hans Kellerer, Ulrich Pferschy: A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. J. Comb. Optim. 3(1): 59-71 (1999)

Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger: Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. SIAM J. Comput. 28(4): 1155-1166 (1999)

Hans Kellerer: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. RANDOM-APPROX 1999: 51-62

Rainer E. Burkard, Y. He, Hans Kellerer: A Linear Compound Algorithm for Uniform Machine Scheduling. Computing 61(1): 1-10 (1998)

Paolo Dell'Olmo, Hans Kellerer, Maria Grazia Speranza, Zsolt Tuza: A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins. Inf. Process. Lett. 65(5): 229-233 (1998)

Luitpold Babel, Hans Kellerer, Vladimir Kotov: Thek-partitioning problem. Math. Meth. of OR 47(1): 59-82 (1998)

Hans Kellerer, Ulrich Pferschy: A New Fully Polynomial Approximation Scheme for the Knapsack Problem. APPROX 1998: 123-134

Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza: Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21(5): 235-242 (1997)

Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza: An Efficient Approximation Scheme for the Subset-Sum Problem. ISAAC 1997: 394-403

Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger: Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. STOC 1996: 418-426

Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger: A Lower Bound for On-Line Vector-Packing Algorithms. Acta Cybern. 11(1-2): 23-34 (1993)

Hans Kellerer, Gerhard J. Woeginger: A Tight Bound for 3-Partitioning. Discrete Applied Mathematics 45(3): 249-259 (1993)

Hans Kellerer, Gerhard J. Woeginger: On the Euclidean two Paths Problem. Discrete Applied Mathematics 47(2): 165-173 (1993)

Hans Kellerer, Franz Rendl, Gerhard J. Woeginger: Computing the optimum stock size. IPCO 1993: 147-159

Hans Kellerer, Gerhard J. Woeginger: UET-scheduling with constrained processor allocations. Computers & OR 19(1): 1-8 (1992)

Hans Kellerer, Günther Wirsching: Prime covers and periodic patterns. Discrete Mathematics 85(2): 191-206 (1990)

Werner Heise, Hans Kellerer: Eine Verschärfung der Quadratwurzel-Schranke für Quadratische-Rest-Codes einer Länge n = -1 mod 4. Elektronische Informationsverarbeitung und Kybernetik 23(2/3): 113-124 (1987)