Hans Kellerer - Concepedia

Author

Hans Kellerer

University of Graz ORCID

Also Known As

C. Potts, H. G. Kellerer, H. Kellerer, HANS KELLERER, Hans G Kellerer, Hans G. Kellerer, Hans Kellerer, Kellerer, Hans

154

Publications

5.7K

Citations

H-Index

Concepts

All Affiliations

University of Graz University of Greenwich Graz University of Technology Hungarian Academy of Sciences University of Bologna

About

Hans Kellerer is an author at University of Graz specializing in engineering, mathematical programming, and combinatorial optimization.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	27	53	2.4K
2	Computer Engineering	11	12	475
3	Business	9	9	219
4	Management	1	1	172
5	Natural Sciences	1	1	21

Hans Kellerer

Publications

2.9K

Citations

H-Index

Page 1

	Year	Citations
Approximation algorithms for knapsack problems with cardinality constraints Alberto Caprara, Hans Kellerer, Ulrich Pferschy, European Journal of Operational Research Mathematical ProgrammingEngineeringInteger OptimizationCombinatorial ProblemDiscrete Optimization	2000	188
Semi on-line algorithms for the partition problem Hans Kellerer, M. Grazia Speranza, Źsolt Tuza Operations Research Letters Mathematical ProgrammingEngineeringAlgorithmic LibraryAlgorithm DesignPartition (Database)	1997	178
Optimization of cardinality constrained portfolios with a hybrid local search algorithm Dietmar Maringer, Hans Kellerer OR Spectrum Mathematical ProgrammingPortfolio OptimizationEngineeringPortfolio AllocationManagement	2003	172
Selecting Portfolios with Fixed Costs and Minimum Transaction Lots Hans Kellerer, Renata Mansini, M. Grazia Speranza Annals of Operations Research	2000	162
Approximating Multiobjective Knapsack Problems Thomas Erlebach, Hans Kellerer, Ulrich Pferschy Management Science Mathematical ProgrammingMultiobjective Knapsack ProblemsPareto FrontierEngineeringInteger Optimization	2002	113
The Multiple Subset Sum Problem Alberto Caprara, Hans Kellerer, Ulrich Pferschy SIAM Journal on Optimization Mathematical ProgrammingEngineeringComputational ComplexityDiscrete OptimizationOperations Research	2000	105
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem Hans Kellerer, Ulrich Pferschy Journal of Combinatorial Optimization	1999	98
Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications Hans Kellerer, Vitaly A. Strusevich Algorithmica Mathematical ProgrammingEngineeringScheduling ProblemOptimization ProblemScheduling Applications	2008	98
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem Hans Kellerer, Ulrich Pferschy Journal of Combinatorial Optimization Mathematical ProgrammingEngineeringInteger OptimizationOptimization ProblemDiscrete Optimization	2004	91
Approximability and nonapproximability results for minimizing total flow time on a single machine Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger Mathematical ProgrammingNumerical AnalysisEngineeringAnalysis Of AlgorithmSingle Machine Share	1996	83

Page 1