Hans Kellerer

发表

The exact LPT-bound for maximizing the minimum completion time

Gerhard J. Woeginger, János Csirik, Hans Kellerer, 1992, Oper. Res. Lett..

Other Knapsack Problems

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

On the Euclidean two Paths Problem

Gerhard J. Woeginger, Hans Kellerer, G. Woeginger, 1993, Discret. Appl. Math..

Some Selected Applications

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times

Hans Kellerer, Imed Kacem, H. Kellerer, 2014, Discret. Appl. Math..

Semi on-line algorithms for the partition problem

Zsolt Tuza, Hans Kellerer, Maria Grazia Speranza, 1997, Oper. Res. Lett..

Using weight decision for decreasing the price of anarchy in selfish bin packing games

Zsolt Tuza, Hans Kellerer, György Dósa, 2019, Eur. J. Oper. Res..

Algorithms for on-line bin-packing problems with cardinality constraints

Hans Kellerer, Bo Chen, Vladimir Kotov, 2004, Discret. Appl. Math..

A 3/4-Approximation Algorithm for Multiple Subset Sum

Hans Kellerer, Alberto Caprara, Ulrich Pferschy, 2003, J. Heuristics.

Online Results for Black and White Bin Packing

Zsolt Tuza, Hans Kellerer, Leah Epstein, 2014, Theory of Computing Systems.

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

Hans Kellerer, H. Kellerer, 1999, RANDOM-APPROX.

Thek-partitioning problem

Hans Kellerer, Vladimir Kotov, Luitpold Babel, 1998, Math. Methods Oper. Res..

Two linear approximation algorithms for the subset-sum problem

Hans Kellerer, Maria Grazia Speranza, Renata Mansini, 2000, Eur. J. Oper. Res..

Optimization of cardinality constrained portfolios with a hybrid local search algorithm

Hans Kellerer, Dietmar Maringer, H. Kellerer, 2003, OR Spectr..

On-Line Algorithms for Cardinality Constrained Bin Packing Problems

Hans Kellerer, Bo Chen, Vladimir Kotov, 2001, ISAAC.

An Efficient Approximation Scheme for the Subset-Sum Problem

Hans Kellerer, Maria Grazia Speranza, Ulrich Pferschy, 1997, ISAAC.

A 3/2-approximation algorithm for 3/2-partitioning

Hans Kellerer, Vladimir Kotov, H. Kellerer, 2011, Oper. Res. Lett..

A linear compound algorithm for uniform machine scheduling

Hans Kellerer, Rainer E. Burkard, Y. He, 2007, Computing.

Approximation Algorithms for the Knapsack Problem

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

Lower Bounds and Semi On-line Multiprocessor Scheduling

T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov, 2003, Comput. Sci. J. Moldova.

The Unbounded Knapsack Problem

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

Eine Verschärfung der Quadratwurzel-Schranke für Quadratische-Rest-Codes einer Länge n = -1 mod 4

Hans Kellerer, Werner Heise, H. Kellerer, 1987, J. Inf. Process. Cybern..

Basic Algorithmic Concepts

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

A Lower Bound for On-Line Vector-Packing Algorithms

Gerhard J. Woeginger, Hans Kellerer, Gábor Galambos, 1993, Acta Cybern..

Models and Algorithms for Planning and Scheduling Problems

Hans Kellerer, Alexander Grigoriev, Vitaly A. Strusevich, 2003 .

Approximating Multi-objective Knapsack Problems

Hans Kellerer, Thomas Erlebach, Ulrich Pferschy, 2001, WADS.

Selecting Portfolios with Fixed Costs and Minimum Transaction Lots

Hans Kellerer, Maria Grazia Speranza, Renata Mansini, 2000, Ann. Oper. Res..

Scheduling problems for parallel dedicated machines under multiple resource constraints

Hans Kellerer, Vitaly A. Strusevich, H. Kellerer, 2003, Discret. Appl. Math..

Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval

Hans Kellerer, Imed Kacem, Maryam Seifaddini, 2016, J. Comb. Optim..

Semi-online scheduling on a single machine with unexpected breakdown

Hans Kellerer, Imed Kacem, 2016, Theor. Comput. Sci..

Stochastic Aspects of Knapsack Problems

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

UET-scheduling with constrained processor allocations

Gerhard J. Woeginger, Hans Kellerer, 1992, Comput. Oper. Res..

Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product

Hans Kellerer, Vitaly A. Strusevich, 2013, Eur. J. Oper. Res..

Offline black and white bin packing

Zsolt Tuza, Hans Kellerer, Leah Epstein, 2015, Theor. Comput. Sci..

Minimizing the Maximum Lateness

Hans Kellerer, H. Kellerer, 2004, Handbook of Scheduling.

Foreword: Combinatorial optimization for industrial engineering

Hans Kellerer, Imed Kacem, 2011, Comput. Ind. Eng..

A PTAS for the Multiple Subset Sum Problem with different knapsack capacities

Hans Kellerer, Alberto Caprara, Ulrich Pferschy, 2000, Inf. Process. Lett..

Scheduling Two Chains on Parallel Dedicated Machines

Hans Kellerer, Alessandro Agnetis, Andrea Pacifici, 2012, CTW.

Design of tariff zones in public transportation networks: theoretical results and heuristics

Hans Kellerer, Luitpold Babel, 2003, Math. Methods Oper. Res..

An efficient algorithm for bin stretching

Hans Kellerer, Vladimir Kotov, H. Kellerer, 2013, Oper. Res. Lett..

A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date

Hans Kellerer, Vitaly A. Strusevich, Kabir Rustogi, 2020 .

Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval

Hans Kellerer, Imed Kacem, Maryam Seifaddini, 2014, ISCO.

Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem

Hans Kellerer, Ulrich Pferschy, H. Kellerer, 2004, J. Comb. Optim..

An efficient fully polynomial approximation scheme for the Subset-Sum Problem

Hans Kellerer, Maria Grazia Speranza, Ulrich Pferschy, 2003, J. Comput. Syst. Sci..

The Multiple Subset Sum Problem

Hans Kellerer, Alberto Caprara, Ulrich Pferschy, 2000, SIAM J. Optim..

Approximability and nonapproximability results for minimizing total flow time on a single machine

Gerhard J. Woeginger, Hans Kellerer, Thomas Tautenhahn, 1996, STOC '96.

An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing

Hans Kellerer, Vladimir Kotov, H. Kellerer, 2003, Oper. Res. Lett..

A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem

Hans Kellerer, Ulrich Pferschy, H. Kellerer, 1999, J. Comb. Optim..

Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval

Hans Kellerer, Imed Kacem, 2018, ICCL.

The symmetric quadratic knapsack problem: approximation and scheduling applications

Hans Kellerer, Vitaly A. Strusevich, 2012, 4OR.

Foreword - Advanced Optimization Approaches and Modern OR-Applications

Hans Kellerer, Imed Kacem, Pierre Laroche, 2016, RAIRO Oper. Res..

Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-Algorithm

Hans Kellerer, H. Kellerer, 1991, Computing.

A Tight Bound for 3-Partitioning

Gerhard J. Woeginger, Hans Kellerer, G. Woeginger, 1993, Discret. Appl. Math..

A 5/4 Linear Time Bin Packing Algorithm

Hans Kellerer, József Békési, Gábor Galambos, 2000, J. Comput. Syst. Sci..

Black and White Bin Packing

Zsolt Tuza, Hans Kellerer, József Békési, 2012, WAOA.

Approximating Multiobjective Knapsack Problems

Hans Kellerer, Thomas Erlebach, Ulrich Pferschy, 2002, Manag. Sci..

Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications

Hans Kellerer, Vitaly A. Strusevich, H. Kellerer, 2010, Algorithmica.

Scheduling parallel dedicated machines under a single non-shared resource

Hans Kellerer, Vitaly A. Strusevich, H. Kellerer, 2003, European Journal of Operational Research.

Scheduling Two Chains on m Machines

Hans Kellerer, Andrea Pacifici, A. Agnetis, 2012 .

Knapsack problems

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

Preemptive scheduling on two identical parallel machines with a single transporter

Hans Kellerer, Vitaly A. Strusevich, Alan J. Soper, 2013, J. Comb. Optim..

The Stock Size Problem

Gerhard J. Woeginger, Franz Rendl, Hans Kellerer, 1998, Oper. Res..

Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints

Hans Kellerer, Imed Kacem, H. Kellerer, 2017, Algorithmica.

Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine

Gerhard J. Woeginger, Hans Kellerer, Thomas Tautenhahn, 1999, SIAM J. Comput..

Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance

Hans Kellerer, Vitaly A. Strusevich, Kabir Rustogi, 2013, J. Sched..

Semi-on-line multiprocessor scheduling with given total processing time

T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov, 2005, Theor. Comput. Sci..

Approximation algorithms for knapsack problems with cardinality constraints

Hans Kellerer, Alberto Caprara, David Pisinger, 2000, Eur. J. Oper. Res..

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications

Hans Kellerer, Vitaly A. Strusevich, 2016, Ann. Oper. Res..

Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem

Hans Kellerer, Peter Greistorfer, 2001, J. Heuristics.

Transporting Jobs through a Processing Center with Two Parallel Machines

Hans Kellerer, Vitaly A. Strusevich, Alan J. Soper, 2010, COCOA.

Computing the optimum stock size

Gerhard J. Woeginger, Franz Rendl, Hans Kellerer, 1993, IPCO.

Approximation schemes for ordered vector packing problems

Hans Kellerer, Alberto Caprara, Ulrich Pferschy, 2001, RANDOM-APPROX.

Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy

Zsolt Tuza, Hans Kellerer, György Dósa, 2018, WAOA.

Approximability issues for unconstrained and constrained maximization of half-product related functions

Hans Kellerer, Vitaly A. Strusevich, Rebecca Sarto Basso, 2017, Theor. Comput. Sci..

Multidimensional Knapsack Problems

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

An efficient algorithm for semi-online multiprocessor scheduling with given total processing time

Hans Kellerer, Michaël Gabay, Vladimir Kotov, 2015, J. Sched..

Operator non-availability periods

Gerd Finke, Chris N. Potts, Hans Kellerer, 2009, 4OR.

An approximation algorithm for identical parallel machine scheduling with resource dependent processing times

Hans Kellerer, 2008, Oper. Res. Lett..

A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins

Zsolt Tuza, Hans Kellerer, Paolo Dell'Olmo, 1998, Inf. Process. Lett..

A Greedy-heuristic for 3-partitioning with similar elements

Gerhard J. Woeginger, Hans Kellerer, 2005, Computing.

Complexity results for common due date scheduling problems with interval data and minmax regret criterion

Hans Kellerer, Imed Kacem, 2019, Discret. Appl. Math..

Prime covers and periodic patterns

Hans Kellerer, Günther Wirsching, 1990, Discret. Math..

Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints

Hans Kellerer, Vitaly A. Strusevich, Nir Halman, 2018, Eur. J. Oper. Res..

Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval

Hans Kellerer, Vitaly A. Strusevich, Mikhail A. Kubzin, 2009, Eur. J. Oper. Res..

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

Hans Kellerer, Imed Kacem, 2011, J. Sched..

Restricted assignment scheduling with resource constraints

Zsolt Tuza, Hans Kellerer, György Dósa, 2019, Theor. Comput. Sci..

Advanced Algorithmic Concepts

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

Bottleneck quadratic assignment problem and the bandwidth problem

Hans Kellerer, Günther Wirsching, 1998 .

Batch machine production with perishability time windows and limited batch size

Celia A. Glass, Konstantin Chakhlevitch, Hans Kellerer, 2011, Eur. J. Oper. Res..

Algorithms better than LPT for semi-online scheduling with decreasing processing times

T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov, 2012, Oper. Res. Lett..

Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals

Hans Kellerer, Imed Kacem, Yann Lanuel, 2015, J. Comb. Optim..

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

Hans Kellerer, Vitaly A. Strusevich, 2006, Theor. Comput. Sci..

A New Fully Polynomial Approximation Scheme for the Knapsack Problem

Hans Kellerer, Ulrich Pferschy, H. Kellerer, 1998, APPROX.

Cardinality constrained bin‐packing problems

Hans Kellerer, Ulrich Pferschy, H. Kellerer, 1999, Ann. Oper. Res..

Parallel dedicated machines scheduling with chain precedence constraints

Hans Kellerer, Alessandro Agnetis, Andrea Pacifici, 2012, Eur. J. Oper. Res..

The Bounded Knapsack Problem

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

Scheduling parallel dedicated machines with the speeding‐up resource

Hans Kellerer, Vitaly A. Strusevich, 2003 .

Parallel machine scheduling with job assignment restrictions

Celia A. Glass, Hans Kellerer, H. Kellerer, 2007 .

Preface: New trends on combinatorial optimization for network and logistical applications

Hans Kellerer, Ali Ridha Mahjoub, Imed Kacem, 2021, Annals of Operations Research.

An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time

Zsolt Tuza, Hans Kellerer, György Dósa, 2021, Theor. Comput. Sci..

The Quadratic Knapsack Problem

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

Linear compound algorithms for the partitioning problem

Hans Kellerer, Vladimir Kotov, H. Kellerer, 2000 .

A 7/6–Approximation Algorithm For 3-Partitioning And Its Application To Multiprocessor Scheduling

Hans Kellerer, Vladimir Kotov, H. Kellerer, 1999 .

Multiple Knapsack Problems

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

Note: Open shop scheduling with release dates to minimize maximum lateness

Gerhard J. Woeginger, Hans Kellerer, Thomas Tautenhahn, 1995 .

The Subset Sum Problem

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

Dynamic Pricing to Minimize Maximum Regret

Hans Kellerer, Zhi-Long Chen, Nicholas G. Hall, 2017 .