World's Best Scientists 2026 revealed!
Ulrich Pferschy

Ulrich Pferschy

D-Index & Metrics

Mathematics

D-Index
33
Citations
9870
World Ranking
2976
National Ranking
39

Overview

Ulrich Pferschy is affiliated with the University of Graz in Austria and has a research profile focused on engineering and computer science. Their work spans several specialized subfields, including industrial and manufacturing engineering, computer networks and communications, management science and operations research, computational theory and mathematics, and electrical and electronic engineering.

The primary thematic areas of Pferschy's scholarly contributions include:

  • Advanced Manufacturing and Logistics Optimization
  • Optimization and Search Problems
  • Scheduling and Optimization Algorithms
  • Optimization and Packing Problems
  • Game Theory and Voting Systems
  • Advanced Graph Theory Research
  • Auction Theory and Applications

Pferschy has coauthored publications with several researchers, most frequently collaborating with Joachim Schauer, Nina Chiarelli, Martin Milanič, Stefan Lendl, and Gaia Nicosia. These partnerships indicate engagement with a network of researchers working in complementary areas within operations research and applied optimization.

The scholar's publication record includes articles in multiple well-known venues. Among the most frequent publication platforms are arXiv (Cornell University), SSRN Electronic Journal, European Journal of Operational Research, Journal of Scheduling, and Computers & Operations Research.

Notable recent papers by Ulrich Pferschy include:

  • "On the Stackelberg knapsack game," published in 2020 in the European Journal of Operational Research
  • "Approximating the product knapsack problem," published in 2021 in Optimization Letters
  • "Operational Research: methods and applications," published in 2023 in the Journal of the Operational Research Society

Other topical papers by coauthors but relevant to the network of work include "Planning a zero-emission mixed-fleet public bus system with minimal life cycle cost" (2023, Public Transport) and "Mean-variance portfolio optimization based on ordinal information" (2020, Journal of Banking & Finance).

Ulrich Pferschy's work predominantly addresses optimization methodologies and algorithmic challenges related to manufacturing, logistics, scheduling, and game-theoretic contexts. The scholar's expertise in optimization problems is reflected through publications that explore both theoretical and applied aspects, covering various problem formulations and algorithmic solutions within operational research.

Best Publications

  • Multidimensional Knapsack Problems

    Hans Kellerer;Ulrich Pferschy;David Pisinger

  • An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem

    Ivana Ljubić;René Weiskircher;Ulrich Pferschy;Gunnar W. Klau

  • The Multidimensional Knapsack Problem: Structure and Algorithms

    Jakob Puchinger;Günther R. Raidl;Ulrich Pferschy

  • Approximation algorithms for knapsack problems with cardinality constraints

    Alberto Caprara;Hans Kellerer;Ulrich Pferschy;David Pisinger

  • Introduction to NP-Completeness of Knapsack Problems

    Hans Kellerer;Ulrich Pferschy;David Pisinger

  • The Knapsack Problem with Conflict Graphs

    Ulrich Pferschy;Joachim Schauer

  • Approximating Multiobjective Knapsack Problems

    Thomas Erlebach;Hans Kellerer;Ulrich Pferschy

  • The Multiple Subset Sum Problem

    Alberto Caprara;Hans Kellerer;Ulrich Pferschy

  • Paths, trees and matchings under disjunctive constraints

    Andreas Darmann;Ulrich Pferschy;Joachim Schauer;Gerhard J. Woeginger

  • 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 core concept for the multidimensional knapsack problem

    Jakob Puchinger;Günther R. Raidl;Ulrich Pferschy

  • The Multiple-Choice Knapsack Problem

    Hans Kellerer;Ulrich Pferschy;David Pisinger

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

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

  • Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem

    Gunnar W. Klau;Ivana Ljubic;Andreas Moser;Petra Mutzel

  • Operational Research: methods and applications

    Unknown

  • Exact solution of the robust knapsack problem

    Michele Monaci;Ulrich Pferschy;Paolo Serafini

  • The maximum flow problem with disjunctive constraints

    Ulrich Pferschy;Joachim Schauer

  • Optimised scheduling in human–robot collaboration – a use case in the assembly of printed circuit boards

    Karin Bogner;Ulrich Pferschy;Roland Unterberger;Herwig Zeiner

  • Approximation schemes for ordered vector packing problems

    Alberto Caprara;Hans Kellerer;Ulrich Pferschy

  • Dynamic programming revisited: improving knapsack algorithms

    U. Pferschy

  • Generating subtour elimination constraints for the TSP from pure integer solutions

    Ulrich Pferschy;Rostislav Stanek

Frequent Co-Authors

Hans Kellerer
Hans Kellerer University of Graz
David Pisinger
David Pisinger Technical University of Denmark
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Alberto Caprara
Alberto Caprara University of Bologna
Petra Mutzel
Petra Mutzel University of Bonn
Gunnar W. Klau
Gunnar W. Klau Heinrich Heine University Düsseldorf
Rainer E. Burkard
Rainer E. Burkard Graz University of Technology
Michele Monaci
Michele Monaci University of Bologna
Atanas G. Atanasov
Atanas G. Atanasov Medical University of Vienna

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

For students pursuing Mathematics in the USA, exploring related online degrees can enhance both skills and career opportunities. For instance, a masters in digital marketing combines analytical thinking with market trends, ideal for those interested in data-driven marketing strategies.

Business skills are also highly complementary. Many opt for a 1 year mba program to quickly gain leadership and management expertise, fast-tracking career advancement in corporate environments.

Flexibility is key for working professionals. Online programs that allow for online mba transfer credits make continuing education more accessible and affordable, enabling learners to build on prior work or academic experience seamlessly.

For those focused on the intersection of mathematics and technology, pursuing a data analytics master's degree offers advanced training in interpreting complex datasets—an essential skill in today’s data-driven job market.

Best Scientists Citing Ulrich Pferschy

Trending Scientists

Recently Published Articles