Partitioning Graphs into Two Trees. - Ulrich Pferschy; Gerhard J. Woeginger; En-Yu Yao (Acta Cybern., 1994)

Linear programs with an additional rank two reverse convex constraint. - Ulrich Pferschy; Hoang Tuy (J. Glob. Optim., 1994)

Some Geometric Clustering Problems. - Ulrich Pferschy; Rüdiger Rudolf; Gerhard J. Woeginger (Nord. J. Comput., 1994)

Monge matrices make maximization manageable. - Ulrich Pferschy; Rüdiger Rudolf; Gerhard J. Woeginger (Oper. Res. Lett., 1994)

Worst-Case Analysis for On-Line Data Compression. - József Békési; Gábor Galambos; Ulrich Pferschy; Gerhard J. Woeginger (Combinatorics and Computer Science, 1995)

The Random Linear Bottleneck Assignment Problem. - Ulrich Pferschy (IPCO, 1995)

The Fractional Greedy Algorithm for Data Compression. - József Békési; Gábor Galambos; Ulrich Pferschy; Gerhard J. Woeginger (Computing, 1996)

An Efficient Approximation Scheme for the Subset-Sum Problem. - Hans Kellerer; Ulrich Pferschy; Maria Grazia Speranza (ISAAC, 1997)

Solution Methods and Computational Investigations for the Linear Bottleneck Assignment Problem. - Ulrich Pferschy (Computing, 1997)

Simple But Efficient Approaches for the Collapsing Knapsack Problem. - Ulrich Pferschy; David Pisinger; Gerhard J. Woeginger (Discret. Appl. Math., 1997)

Greedy Algorithms for On-Line Data Compression. - József Békési; Gábor Galambos; Ulrich Pferschy; Gerhard J. Woeginger (J. Algorithms, 1997)

A New Fully Polynomial Approximation Scheme for the Knapsack Problem. - Hans Kellerer; Ulrich Pferschy (APPROX, 1998)

Cardinality constrained bin‐packing problems. - Hans Kellerer; Ulrich Pferschy (Ann. Oper. Res., 1999)

Dynamic Programming Revisited: Improving Knapsack Algorithms. - Ulrich Pferschy (Computing, 1999)

A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. - Hans Kellerer; Ulrich Pferschy (J. Comb. Optim., 1999)

Approximation algorithms for knapsack problems with cardinality constraints. - Alberto Caprara; Hans Kellerer; Ulrich Pferschy; David Pisinger (Eur. J. Oper. Res., 2000)

A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. - Alberto Caprara; Hans Kellerer; Ulrich Pferschy (Inf. Process. Lett., 2000)

The Multiple Subset Sum Problem. - Alberto Caprara; Hans Kellerer; Ulrich Pferschy (SIAM J. Optim., 2000)

Approximation Schemes for Ordered Vector Packing Problems. - Alberto Caprara; Hans Kellerer; Ulrich Pferschy (RANDOM-APPROX, 2001)

Approximating Multi-objective Knapsack Problems. - Thomas Erlebach; Hans Kellerer; Ulrich Pferschy (WADS, 2001)

Approximating Multiobjective Knapsack Problems. - Thomas Erlebach; Hans Kellerer; Ulrich Pferschy (Manag. Sci., 2002)

The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. - Gunnar W. Klau; Ivana Ljubic; Petra Mutzel; Ulrich Pferschy; René Weiskircher (ESA, 2003)

A 3/4-Approximation Algorithm for Multiple Subset Sum. - Alberto Caprara; Hans Kellerer; Ulrich Pferschy (J. Heuristics, 2003)

An efficient fully polynomial approximation scheme for the Subset-Sum Problem. - Hans Kellerer; Renata Mansini; Ulrich Pferschy; Maria Grazia Speranza (J. Comput. Syst. Sci., 2003)

Knapsack problems. - Hans Kellerer; Ulrich Pferschy; David Pisinger (Springer, 2004)

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. - Gunnar W. Klau; Ivana Ljubic; Andreas Moser; Petra Mutzel; Philipp Neuner; Ulrich Pferschy; Günther R. Raidl; René Weiskircher (GECCO (1), 2004)

Securitization of Financial Assets: Approximation in Theory and Practice. - Renata Mansini; Ulrich Pferschy (Comput. Optim. Appl., 2004)

Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. - Hans Kellerer; Ulrich Pferschy (J. Comb. Optim., 2004)

Worst-case analysis of the subset sum algorithm for bin packing. - Alberto Caprara; Ulrich Pferschy (Oper. Res. Lett., 2004)

Solving the Prize-Collecting Steiner Tree Problem to Optimality. - Ivana Ljubic; René Weiskircher; Ulrich Pferschy; Gunnar W. Klau; Petra Mutzel; Matteo Fischetti (ALENEX/ANALCO, 2005)

Modified subset sum heuristics for bin packing. - Alberto Caprara; Ulrich Pferschy (Inf. Process. Lett., 2005)

The Core Concept for the Multidimensional Knapsack Problem. - Jakob Puchinger; Günther R. Raidl; Ulrich Pferschy (EvoCOP, 2006)

ILP Models for a Nurse Scheduling Problem. - Bettina Klinz; Ulrich Pferschy; Joachim Schauer (OR, 2006)

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. - Daniel Wagner; Günther R. Raidl; Ulrich Pferschy; Petra Mutzel; Peter Bachhiesl (OR, 2006)

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. - Ivana Ljubic; René Weiskircher; Ulrich Pferschy; Gunnar W. Klau; Petra Mutzel; Matteo Fischetti (Math. Program., 2006)

The traveling group problem. - Christian Klamler; Ulrich Pferschy (Soc. Choice Welf., 2007)

Determining a Minimum Spanning Tree with Disjunctive Constraints. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (ADT, 2009)

Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals. - Christian Klamler; Ulrich Pferschy; Stefan Ruzika (ADT, 2009)

Subset Weight Maximization with Two Competing Agents. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (ADT, 2009)

Combinatorial Optimization Problems with Conflict Graphs. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer; Gerhard J. Woeginger (CTW, 2009)

On Multi-Agent Knapsack Problems. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (CTW, 2009)

A Two-Period Portfolio Selection Model for Asset-backed Securitization. - Renata Mansini; Ulrich Pferschy (Algorithmic Oper. Res., 2009)

Inverse 1-center location problems with edge length augmentation on trees. - Behrooz Alizadeh; Rainer E. Burkard; Ulrich Pferschy (Computing, 2009)

The Knapsack Problem with Conflict Graphs. - Ulrich Pferschy; Joachim Schauer (J. Graph Algorithms Appl., 2009)

Maximizing the minimum voter satisfaction on spanning trees. - Andreas Darmann; Christian Klamler; Ulrich Pferschy (Math. Soc. Sci., 2009)

The Multidimensional Knapsack Problem: Structure and Algorithms. - Jakob Puchinger; Günther R. Raidl; Ulrich Pferschy (INFORMS J. Comput., 2010)

A note on maximizing the minimum voter satisfaction on spanning trees. - Andreas Darmann; Christian Klamler; Ulrich Pferschy (Math. Soc. Sci., 2010)

Resource allocation with time intervals. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (Theor. Comput. Sci., 2010)

The Maximum Flow Problem with Conflict and Forcing Conditions. - Ulrich Pferschy; Joachim Schauer (INOC, 2011)

Paths, trees and matchings under disjunctive constraints. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer; Gerhard J. Woeginger (Discret. Appl. Math., 2011)

Competitive subset selection with two agents. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (Discret. Appl. Math., 2011)

Strategies for Single-machine Multi-agent Scheduling Problems. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (CTW, 2012)

Committee selection under weight constraints. - Christian Klamler; Ulrich Pferschy; Stefan Ruzika (Math. Soc. Sci., 2012)

Two Agents Competing for a Shared Machine. - Alessandro Agnetis; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (ADT, 2013)

Approximating the Quadratic Knapsack Problem on Special Graph Classes. - Ulrich Pferschy; Joachim Schauer (WAOA, 2013)

Strategies in competing subset selection. - Claudia Marini; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (Ann. Oper. Res., 2013)

Exact solution of the robust knapsack problem. - Michele Monaci; Ulrich Pferschy; Paolo Serafini (Comput. Oper. Res., 2013)

The maximum flow problem with disjunctive constraints. - Ulrich Pferschy; Joachim Schauer (J. Comb. Optim., 2013)

On the Robust Knapsack Problem. - Michele Monaci; Ulrich Pferschy (SIAM J. Optim., 2013)

Media Mix Optimization - Applying a Quadratic Knapsack Model. - Ulrich Pferschy; Joachim Schauer; Gerhild Maier (ICORES, 2014)

A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign. - Ulrich Pferschy; Joachim Schauer; Gerhild Maier (ICORES (Selected Papers), 2014)

The Shortest Path Game: Complexity and Algorithms. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (IFIP TCS, 2014)

The Subset Sum game. - Andreas Darmann; Gaia Nicosia; Ulrich Pferschy; Joachim Schauer (Eur. J. Oper. Res., 2014)

Price of Fairness for Multiagent Subset Sum Problems. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (CTW, 2015)

Personnel Planning with Multi-tasking and Structured Qualifications. - Tobias Kreiter; Ulrich Pferschy; Joachim Schauer (OR, 2015)

Brief Announcement: On the Fair Subset Sum Problem. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (SAGT, 2015)

On the shortest path game: extended version. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (CoRR, 2015)

Scheduling two agent task chains with a central selection mechanism. - Alessandro Agnetis; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (J. Sched., 2015)

Two agent scheduling with a central selection mechanism. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (Theor. Comput. Sci., 2015)

Maximin Fairness-profit Tradeoff in Project Budget Allocation. - Maurizio Naldi; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (CENTERIS/ProjMAN/HCist, 2016)

A Simulation study of Fairness-Profit Trade-off in Project Selection based on HHI and Knapsack Models. - Maurizio Naldi; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy; Bernhard Leder (EMS, 2016)

Linear Models and Computational Experiments for the Quadratic TSP. - Anja Fischer; J. Fabian Meier; Ulrich Pferschy; Rostislav Stanek (Electron. Notes Discret. Math., 2016)

Maximin Fairness in Project Budget Allocation. - Maurizio Naldi; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (Electron. Notes Discret. Math., 2016)

Approximation of the Quadratic Knapsack Problem. - Ulrich Pferschy; Joachim Schauer (INFORMS J. Comput., 2016)

Approximation Results for the Incremental Knapsack Problem. - Federico Della Croce; Ulrich Pferschy; Rosario Scatamacchia (IWOCA, 2017)

Generating subtour elimination constraints for the TSP from pure integer solutions. - Ulrich Pferschy; Rostislav Stanek (Central Eur. J. Oper. Res., 2017)

Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem. - Federico Della Croce; Ulrich Pferschy; Rosario Scatamacchia (CoRR, 2017)

On the Shortest Path Game. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (Discret. Appl. Math., 2017)

The shortest connection game. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (Discret. Appl. Math., 2017)

Price of Fairness for allocating a bounded resource. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (Eur. J. Oper. Res., 2017)

Approximation of knapsack problems with conflict and forcing graphs. - Ulrich Pferschy; Joachim Schauer (J. Comb. Optim., 2017)

Competitive multi-agent scheduling with an iterative selection rule. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (4OR, 2018)

Geometric and LP-based heuristics for the quadratic travelling salesman problem. - Rostislav Stanek; Peter Greistorfer; Klaus Ladner; Ulrich Pferschy (CoRR, 2018)

On a Stackelberg Subset Sum Game. - Ulrich Pferschy; Gaia Nicosia; Andrea Pacifici (Electron. Notes Discret. Math., 2018)

Order Batching and Routing in a Non-Standard Warehouse. - Ulrich Pferschy; Joachim Schauer (Electron. Notes Discret. Math., 2018)

Optimised scheduling in human-robot collaboration - a use case in the assembly of printed circuit boards. - Karin Bogner; Ulrich Pferschy; Roland Unterberger; Herwig Zeiner (Int. J. Prod. Res., 2018)

Improved dynamic programming and approximation results for the knapsack problem with setups. - Ulrich Pferschy; Rosario Scatamacchia (Int. Trans. Oper. Res., 2018)

Approximating the 3-period Incremental Knapsack Problem. - Federico Della Croce; Ulrich Pferschy; Rosario Scatamacchia (J. Discrete Algorithms, 2018)

Geometric and LP-based heuristics for angular travelling salesman problems in the plane. - Rostislav Stanek; Peter Greistorfer; Klaus Ladner; Ulrich Pferschy (Comput. Oper. Res., 2019)

The Product Knapsack Problem: Approximation and Complexity. - Ulrich Pferschy; Joachim Schauer; Clemens Thielen (CoRR, 2019)

New exact approaches and approximation results for the Penalized Knapsack Problem. - Federico Della Croce; Ulrich Pferschy; Rosario Scatamacchia (Discret. Appl. Math., 2019)

On approximating the Incremental Knapsack Problem. - Federico Della Croce; Ulrich Pferschy; Rosario Scatamacchia (Discret. Appl. Math., 2019)

Integer optimization with penalized fractional values: The Knapsack case. - Enrico Malaguti; Michele Monaci; Paolo Paronuzzi; Ulrich Pferschy (Eur. J. Oper. Res., 2019)

A Stackelberg knapsack game with weight control. - Ulrich Pferschy; Gaia Nicosia; Andrea Pacifici (Theor. Comput. Sci., 2019)

Fair Packing of Independent Sets. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Nevena Pivac; Joachim Schauer (IWOCA, 2020)

Integer programming models versus advanced planning business software for a multi-level mixed-model assembly line problem. - Tobias Kreiter; Ulrich Pferschy (Central Eur. J. Oper. Res., 2020)

Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Nevena Pivac; Ulrich Pferschy (ADT, 2021)

Decision-Support System for the Optimal Technology Split of a Decarbonized Bus Network. - Nathalie Frieß; Ulrich Pferschy (COMPSAC, 2021)

Optimally rescheduling jobs with a LIFO buffer. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy; Julia Resch; Giovanni Righini (CoRR, 2021)

On the Stackelberg knapsack game. - Ulrich Pferschy; Gaia Nicosia; Andrea Pacifici; Joachim Schauer (Eur. J. Oper. Res., 2021)

Approximating the product knapsack problem. - Ulrich Pferschy; Joachim Schauer; Clemens Thielen (Optim. Lett., 2021)

Optimally rescheduling jobs with a Last-In-First-Out buffer. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy; Julia Resch; Giovanni Righini (J. Sched., 2021)

Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system. - Katrin Heßler; Stefan Irnich; Tobias Kreiter; Ulrich Pferschy (OR Spectr., 2022)

REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints. - Francesco Corti; Balz Maag; Joachim Schauer; Ulrich Pferschy; Olga Saukh (CoRR, 2023)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy (CoRR, 2023)

Fair Allocation of Indivisible Items with Conflict Graphs. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Nevena Pivac; Joachim Schauer (Algorithmica, 2023)

Approximating single- and multi-objective nonlinear sum and product knapsack problems. - Jan Boeckmann; Clemens Thielen; Ulrich Pferschy (Discret. Optim., 2023)

Corrigendum to: 'Integer optimization with penalized fractional values: The Knapsack case' [European Journal of Operational Research (2019) 874-888]. - Enrico Malaguti; Michele Monaci; Paolo Paronuzzi; Ulrich Pferschy (Eur. J. Oper. Res., 2023)

Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs. - Ulrich Pferschy; Julia Resch; Giovanni Righini (J. Sched., 2023)

Allocation of indivisible items with individual preference graphs. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy; Nevena Pivac (Discret. Appl. Math., 2023)

One-dimensional stock cutting resilient against singular random defects. - Claudio Arbib; Fabrizio Marinelli 001; Ulrich Pferschy; Fatemeh K. Ranjbar (Comput. Oper. Res., 2023)

Fair allocation algorithms for indivisible items under structured conflict constraints. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Joachim Schauer (Comput. Appl. Math., 2023)

A Dynamic Algorithm Configuration Framework Using Combinatorial Problem Features and Reinforcement Learning. - Elmar Steiner; Ulrich Pferschy (MIC (2), 2024)

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy (CoRR, 2024)

Rescheduling with New Orders Under Bounded Disruption. - Stefan Lendl; Ulrich Pferschy; Elena Rener (INFORMS J. Comput., 2024)

Operational Research: methods and applications. - Fotios Petropoulos; Gilbert Laporte; Emel Aktas; Sibel A. Alumur; Claudia Archetti; Hayriye Ayhan; Maria Battarra; Julia A. Bennell; Jean-Marie Bourjolly; John E. Boylan; Michèle Breton; David Canca; et al. (J. Oper. Res. Soc., 2024)

Planning a zero-emission mixed-fleet public bus system with minimal life cycle cost. - Nathalie Marion Frieß; Ulrich Pferschy (Public Transp., 2024)

Flow shop scheduling with inter-stage flexibility and blocking constraints. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy; Anna Russo Russo; Cecilia Salvatore (Comput. Oper. Res., 2025)

Integrating multiple sources of ordinal information in portfolio optimization. - Eranda Çela; Stephan Hafner; Roland Mestel; Ulrich Pferschy (Ann. Oper. Res., 2025)

Curriculum-based university course timetabling considering individual course of studies. - Elmar Steiner; Ulrich Pferschy; Andrea Schaerf (Central Eur. J. Oper. Res., 2025)