World's Best Scientists 2026 revealed!
Hans Kellerer

Hans Kellerer

D-Index & Metrics

Mathematics

D-Index
34
Citations
10445
World Ranking
2843
National Ranking
36

Overview

Hans Kellerer is affiliated with the University of Graz in Austria and conducts research primarily in the field of Engineering. Their work focuses extensively on Industrial and Manufacturing Engineering, as well as Computer Networks and Communications.

The scientist has explored a range of topics related to scheduling and optimization algorithms, advanced manufacturing and logistics optimization, and various optimization and search problems. Specific topics include:

  • Scheduling and Optimization Algorithms
  • Advanced Manufacturing and Logistics Optimization
  • Optimization and Search Problems
  • Optimization and Packing Problems
  • Assembly Line Balancing Optimization
  • Vehicle Routing Optimization Methods
  • Distributed and Parallel Computing Systems

Kellerer has contributed publications to several recognized academic venues:

  • Annals of Operations Research
  • Procedia Computer Science
  • Theoretical Computer Science
  • EURO Journal on Transportation and Logistics
  • Journal of Combinatorial Optimization

Some of their recent papers include:

  • "The two-flight low risk helicopter transportation problem under the split pickup scenario," 2023, EURO Journal on Transportation and Logistics
  • "Knapsack problems with position-dependent item weights or profits," 2023, Annals of Operations Research
  • "Heuristic approaches for scheduling jobs and vehicles in a cyclic flexible manufacturing system," 2021, Procedia Computer Science
  • "An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time," 2021, Theoretical Computer Science
  • "Preface: New trends on combinatorial optimization for network and logistical applications," 2021, Annals of Operations Research

The scientist frequently collaborates with other researchers, including Imed Kacem, Stanisław Gawiejnowicz, Nir Halman, Martin Gutjahr, and Sophie N. Parragh.

Best Publications

  • Multidimensional Knapsack Problems

    Hans Kellerer;Ulrich Pferschy;David Pisinger

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

    Hans Kellerer;T. Tautenhahn;G. Woeginger

  • Semi on-line algorithms for the partition problem

    Hans Kellerer;Vladimir Kotov;Maria Grazia Speranza;Zsolt Tuza

  • Approximation algorithms for knapsack problems with cardinality constraints

    Alberto Caprara;Hans Kellerer;Ulrich Pferschy;David Pisinger

  • Selecting Portfolios with Fixed Costs and Minimum Transaction Lots

    Hans Kellerer;Renata Mansini;M. Grazia Speranza

  • Optimization of cardinality constrained portfolios with a hybrid local search algorithm

    Dietmar Maringer;Hans Kellerer

  • Introduction to NP-Completeness of Knapsack Problems

    Hans Kellerer;Ulrich Pferschy;David Pisinger

  • Approximating Multiobjective Knapsack Problems

    Thomas Erlebach;Hans Kellerer;Ulrich Pferschy

  • The Multiple Subset Sum Problem

    Alberto Caprara;Hans Kellerer;Ulrich Pferschy

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

    Hans Kellerer;Vitaly A. Strusevich

  • Improved dynamic programming in connection with an FPTAS for the knapsack problem

    Hans Kellerer;Ulrich Pferschy

  • A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem

    Hans Kellerer;Ulrich Pferschy

  • The Multiple-Choice Knapsack Problem

    Hans Kellerer;Ulrich Pferschy;David Pisinger

  • The exact LPT-bound for maximizing the minimum completion time

    János Csirik;Hans Kellerer;Gerhard Woeginger

  • An efficient fully polynomial approximation scheme for the Subset-Sum problem

    Hans Kellerer;Renata Mansini;Ulrich Pferschy;Maria Grazia Speranza

  • Parallel machine scheduling with job assignment restrictions

    Celia A. Glass;Hans Kellerer

  • Scheduling problems for parallel dedicated machines under multiple resource constraints

    H. Kellerer;V. A. Strusevich

  • Approximation schemes for ordered vector packing problems

    Alberto Caprara;Hans Kellerer;Ulrich Pferschy

  • A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

    Hans Kellerer

  • The k -partitioning problem

    Luitpold Babel;Hans Kellerer;Vladimir Kotov

  • Algorithms for multiprocessor scheduling with machine release times

    Hans Kellerer

Frequent Co-Authors

Ulrich Pferschy
Ulrich Pferschy University of Graz
Vitaly A. Strusevich
Vitaly A. Strusevich University of Greenwich
David Pisinger
David Pisinger Technical University of Denmark
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Alberto Caprara
Alberto Caprara University of Bologna
Zsolt Tuza
Zsolt Tuza University of Pannonia
Renata Mansini
Renata Mansini University of Brescia
Franz Rendl
Franz Rendl University of Klagenfurt
Thomas Erlebach
Thomas Erlebach Durham University
Leah Epstein
Leah Epstein University of Haifa

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to a variety of online degree options that enhance career flexibility and specialization. Many students consider expanding their skills with business-oriented programs. For instance, exploring the easiest mba program options can be a strategic choice for those wanting a smooth transition into leadership roles without demanding entry requirements.

Similarly, if speed and convenience are priorities, reviewing the easiest and fastest online mba programs can help you earn your degree without impacting your current schedule significantly. These programs often accommodate working professionals, marrying rigorous coursework with flexibility.

For those interested in advanced doctoral studies, a 1 year dba program online offers a condensed path to achieving a Doctor of Business Administration degree, complementing a mathematics background with deeper business acumen.

Moreover, combining mathematical expertise with financial knowledge through a master of finance online can unlock lucrative opportunities in finance, analytics, and risk management. These diverse pathways highlight the versatility of mathematics education paired with online learning options.

Best Scientists Citing Hans Kellerer

Trending Scientists

Recently Published Articles