Ulrich Pferschy - Concepedia

Author

Ulrich Pferschy

University of Graz ORCID

Also Known As

Pferschy U., Pferschy, Ulrich, U. Pferschy, Ulrich Pferschy

192

Publications

5.5K

Citations

H-Index

Concepts

All Affiliations

University of Graz Graz University of Technology Roma Tre University University of Bologna University of Rome Tor Vergata

About

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

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	24	43	2.2K
2	Business	15	18	883
3	Management	3	3	46
4	Education	2	2	43
5	Medicine	1	1	12

Ulrich Pferschy

Publications

2.7K

Citations

H-Index

Page 1

	Year	Citations
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem Ivana Ljubić, René Weiskircher, Ulrich Pferschy, Mathematical Programming Mathematical ProgrammingNetwork ScienceGraph TheoryEngineeringNetwork Algorithm	2005	231
The Multidimensional Knapsack Problem: Structure and Algorithms Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy INFORMS journal on computing Mathematical ProgrammingEngineeringDiscrete OptimizationMultidimensional Knapsack ProblemOperations Research	2009	191
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
The Knapsack Problem with Conflict Graphs Ulrich Pferschy, Joachim Schauer Journal of Graph Algorithms and Applications Mathematical ProgrammingEngineeringComputational ComplexityDiscrete OptimizationOperations Research	2009	134
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
Paths, trees and matchings under disjunctive constraints Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Discrete Applied Mathematics Constraint SolvingEngineeringConstraint SatisfactionAutomated ReasoningConstraint Programming	2011	92
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
Operational Research: methods and applications Fotios Petropoulos, Gilbert Laporte, Emel Aktaş, Journal of the Operational Research Society	2023	85

Page 1