H. Kellerer

发表

Duality theorems for marginal problems

H. Kellerer, 1984 .

The Multiple-Choice Knapsack Problem

H. Kellerer, Ulrich Pferschy, David Pisinger, 2004 .

Algorithms for multiprocessor scheduling with machine release times

H. Kellerer, 1998 .

Approximation schemes for ordered vector packing problems

H. Kellerer, Ulrich Pferschy, A. Caprara, 2003 .

Introduction to NP-Completeness of Knapsack Problems

H. Kellerer, Ulrich Pferschy, David Pisinger, 2004 .

Scheduling parallel dedicated machines under a single non-shared resource

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

Online Results for Black and White Bin Packing

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

RANDOM DYNAMICAL SYSTEMS ON ORDERED TOPOLOGICAL SPACES

G. Winkler, H. Kellerer, 2006 .

Approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a fixed job and release dates

H. Kellerer, I. Kacem, 2009, 2009 International Conference on Computers & Industrial Engineering.

Ambiguity in bounded moment problems

H. Kellerer, 1996 .

Continuous transformation of Baire measures into Lebesgue measure

H. Kellerer, 2002 .

Anisotropic excitation transfer to acceptors randomly distributed on surfaces.

H. Kellerer, A. Blumen, 1984, Biophysical journal.

Knapsack problems

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

The symmetric quadratic knapsack problem: approximation and scheduling applications

H. Kellerer, V. Strusevich, 2011, 4OR.

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

H. Kellerer, M. Gabay, V. Kotov, 2015, Journal of Scheduling.

Scheduling Two Chains on m Machines

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

A topological version of Liapunov’s theorem

H. Kellerer, 1999 .

Representation of Markov Kernels by Random Mappings under Order Conditions

H. Kellerer, 1997 .

Approximation algorithms for knapsack problems with cardinality constraints

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

Restricted assignment scheduling with resource constraints

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

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

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

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..

On-Line Algorithms for Cardinality Constrained Bin Packing Problems

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

Approximation schemes for ordered vector packing problems

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

Cardinality constrained bin‐packing problems

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

A Lower Bound for On-Line Vector-Packing Algorithms

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

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.

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..

Minimizing the Maximum Lateness

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

Approximating Multiobjective Knapsack Problems

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

Markov property of point processes

H. Kellerer, 1987 .

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..

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

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

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

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

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

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

Optimization of cardinality constrained portfolios with a hybrid local search algorithm

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

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 .

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

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

On the Euclidean two Paths Problem

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

Offline black and white bin packing

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

Heuristic approaches for scheduling jobs and vehicles in a cyclic flexible manufacturing system

Sophie N. Parragh, H. Kellerer, M. Gutjahr, 2020, ISM.

Online Results for Black and White Bin Packing

H. Kellerer, Z. Tuza, L. Epstein, 2014, Theory of Computing Systems.

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..

An efficient algorithm for bin stretching

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

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

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

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

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

Thek-partitioning problem

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

A Tight Bound for 3-Partitioning

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

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

Hans Kellerer, H. Kellerer, 1991, Computing.

Lower Bounds and Semi On-line Multiprocessor Scheduling

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

Semi on-line algorithms for the partition problem

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

A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem

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

Selecting Portfolios with Fixed Costs and Minimum Transaction Lots

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

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

H. Kellerer, I. Kacem, Y. Lanuel, 2013, Journal of Combinatorial Optimization.

Multiple subset sum with inclusive assignment set restrictions

J. Leung, H. Kellerer, Chung-Lun Li, 2011 .

Parallel machine scheduling with job assignment restrictions

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

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

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

A 5/4 Linear Time Bin Packing Algorithm

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

Baire sets in product spaces

H. Kellerer, 1980 .

The Multiple Subset Sum Problem

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

Scheduling problems for parallel dedicated machines under multiple resource constraints

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

Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack

HANS KELLERER, VITALY A. STRUSEVICH, H. Kellerer, 2010, Int. J. Found. Comput. Sci..

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

G. Woeginger, H. Kellerer, T. Tautenhahn, 1996, STOC '96.

The Stock Size Problem

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

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

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

The exact LPT-bound for maximizing the minimum completion time

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

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

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

The Bounded Knapsack Problem

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

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..

Linear compound algorithms for the partitioning problem

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

Batch machine production with perishability time windows and limited batch size

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

The Subset Sum Problem

Hans Kellerer, David Pisinger, Ulrich Pferschy, 2004 .

Transactions of the American Mathematical Society Uniqueness in Bounded Moment Problems

H. Kellerer, 2022 .

Dynamic Pricing to Minimize Maximum Regret

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

Minkowski functionals of Poisson processes

H. Kellerer, 1984 .

Optimization of cardinality constrained portfolios with a hybrid local search algorithm

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

A New Fully Polynomial Approximation Scheme for the Knapsack Problem

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

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

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

The Multiple Subset Sum Problem

H. Kellerer, Ulri h Pfers, 1998 .

A 3/4-Approximation Algorithm for Multiple Subset Sum

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

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

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

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

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

The Multiple Subset Sum Problem

H. Kellerer, U. Pferschy, Alberto Caprara, 2000, SIAM J. Optim..

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

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

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

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