Ulrich Pferschy

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 52

Top Venues

CoRR

Discret. Appl. Math.

Eur. J. Oper. Res.

Electron. Notes Discret. Math.

Publications

Nathalie Marion Frieß, Ulrich Pferschy
Planning a zero-emission mixed-fleet public bus system with minimal life cycle cost. Public Transp. 16 (1) (2024)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR (2024)
Elmar Steiner, Ulrich Pferschy
A Dynamic Algorithm Configuration Framework Using Combinatorial Problem Features and Reinforcement Learning. MIC (2) (2024)
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, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao
Operational Research: methods and applications. J. Oper. Res. Soc. 75 (3) (2024)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints. CoRR (2023)
Francesco Corti, Balz Maag, Joachim Schauer, Ulrich Pferschy, Olga Saukh
REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints. CoRR (2023)
Ulrich Pferschy, Julia Resch, Giovanni Righini
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs. J. Sched. 26 (3) (2023)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica 85 (5) (2023)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR (2023)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
Fair allocation algorithms for indivisible items under structured conflict constraints. Comput. Appl. Math. 42 (7) (2023)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. 334 (2023)
Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, Ulrich Pferschy
Corrigendum to: 'Integer optimization with penalized fractional values: The Knapsack case' [European Journal of Operational Research (2019) 874-888]. Eur. J. Oper. Res. 307 (2) (2023)
Claudio Arbib, Fabrizio Marinelli, Ulrich Pferschy, Fatemeh K. Ranjbar
One-dimensional stock cutting resilient against singular random defects. Comput. Oper. Res. 157 (2023)
Jan Boeckmann, Clemens Thielen, Ulrich Pferschy
Approximating single- and multi-objective nonlinear sum and product knapsack problems. Discret. Optim. 48 (Part 1) (2023)
Katrin Heßler, Stefan Irnich, Tobias Kreiter, Ulrich Pferschy
Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system. OR Spectr. 44 (2) (2022)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
Allocation of Indivisible Items with Individual Preference Graphs. CoRR (2022)
Ulrich Pferschy, Joachim Schauer, Clemens Thielen
Approximating the product knapsack problem. Optim. Lett. 15 (8) (2021)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini
Optimally rescheduling jobs with a LIFO buffer. CoRR (2021)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini
Optimally rescheduling jobs with a Last-In-First-Out buffer. J. Sched. 24 (6) (2021)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT (2021)
Nathalie Frieß, Ulrich Pferschy
Decision-Support System for the Optimal Technology Split of a Decarbonized Bus Network. COMPSAC (2021)
Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici, Joachim Schauer
On the Stackelberg knapsack game. Eur. J. Oper. Res. 291 (1) (2021)
Tobias Kreiter, Ulrich Pferschy
Integer programming models versus advanced planning business software for a multi-level mixed-model assembly line problem. Central Eur. J. Oper. Res. 28 (3) (2020)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Fair Packing of Independent Sets. IWOCA (2020)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Fair packing of independent sets. CoRR (2020)
Rostislav Stanek, Peter Greistorfer, Klaus Ladner, Ulrich Pferschy
Geometric and LP-based heuristics for angular travelling salesman problems in the plane. Comput. Oper. Res. 108 (2019)
Ulrich Pferschy, Joachim Schauer, Clemens Thielen
The Product Knapsack Problem: Approximation and Complexity. CoRR (2019)
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
New exact approaches and approximation results for the Penalized Knapsack Problem. Discret. Appl. Math. 253 (2019)
Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici
A Stackelberg knapsack game with weight control. Theor. Comput. Sci. 799 (2019)
Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, Ulrich Pferschy
Integer optimization with penalized fractional values: The Knapsack case. Eur. J. Oper. Res. 273 (3) (2019)
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
On approximating the Incremental Knapsack Problem. Discret. Appl. Math. 264 (2019)
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
Approximating the Incremental Knapsack Problem. CoRR (2018)
Rostislav Stanek, Peter Greistorfer, Klaus Ladner, Ulrich Pferschy
Geometric and LP-based heuristics for the quadratic travelling salesman problem. CoRR (2018)
Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici
On a Stackelberg Subset Sum Game. CoRR (2018)
Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici
On a Stackelberg Subset Sum Game. Electron. Notes Discret. Math. 69 (2018)
Karin Bogner, Ulrich Pferschy, Roland Unterberger, Herwig Zeiner
Optimised scheduling in human-robot collaboration - a use case in the assembly of printed circuit boards. Int. J. Prod. Res. 56 (16) (2018)
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
Approximating the 3-period Incremental Knapsack Problem. J. Discrete Algorithms (2018)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Competitive multi-agent scheduling with an iterative selection rule. 4OR 16 (1) (2018)
Ulrich Pferschy, Rosario Scatamacchia
Improved dynamic programming and approximation results for the knapsack problem with setups. Int. Trans. Oper. Res. 25 (2) (2018)
Ulrich Pferschy, Joachim Schauer
Order Batching and Routing in a Non-Standard Warehouse. Electron. Notes Discret. Math. 69 (2018)
Ulrich Pferschy, Rostislav Stanek
Generating subtour elimination constraints for the TSP from pure integer solutions. Central Eur. J. Oper. Res. 25 (1) (2017)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
The shortest connection game. Discret. Appl. Math. 231 (2017)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
On the Shortest Path Game. Discret. Appl. Math. 217 (2017)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Price of Fairness for allocating a bounded resource. Eur. J. Oper. Res. 257 (3) (2017)
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
Approximation Results for the Incremental Knapsack Problem. IWOCA (2017)
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem. CoRR (2017)
Ulrich Pferschy, Joachim Schauer
Approximation of knapsack problems with conflict and forcing graphs. J. Comb. Optim. 33 (4) (2017)
Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Bernhard Leder
A Simulation study of Fairness-Profit Trade-off in Project Selection based on HHI and Knapsack Models. EMS (2016)
Ulrich Pferschy, Joachim Schauer
Approximation of the Quadratic Knapsack Problem. INFORMS J. Comput. 28 (2) (2016)
Anja Fischer, J. Fabian Meier, Ulrich Pferschy, Rostislav Stanek
Linear Models and Computational Experiments for the Quadratic TSP. Electron. Notes Discret. Math. 55 (2016)
Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Maximin Fairness-profit Tradeoff in Project Budget Allocation. CENTERIS/ProjMAN/HCist (2016)
Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Maximin Fairness in Project Budget Allocation. Electron. Notes Discret. Math. 55 (2016)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Two agent scheduling with a central selection mechanism. Theor. Comput. Sci. 596 (2015)
Tobias Kreiter, Ulrich Pferschy, Joachim Schauer
Personnel Planning with Multi-tasking and Structured Qualifications. OR (2015)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
The Shortest Connection Game. CoRR (2015)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
On the shortest path game: extended version. CoRR (2015)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Price of Fairness for Multiagent Subset Sum Problems. CTW (2015)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Brief Announcement: On the Fair Subset Sum Problem. SAGT (2015)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Price of Fairness for Allocating a Bounded Resource. CoRR (2015)
Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Scheduling two agent task chains with a central selection mechanism. J. Sched. 18 (3) (2015)
Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, Joachim Schauer
The Subset Sum game. Eur. J. Oper. Res. 233 (3) (2014)
Ulrich Pferschy, Joachim Schauer, Gerhild Maier
A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign. ICORES (Selected Papers) (2014)
Ulrich Pferschy, Joachim Schauer, Gerhild Maier
Media Mix Optimization - Applying a Quadratic Knapsack Model. ICORES (2014)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
The Shortest Path Game: Complexity and Algorithms. IFIP TCS (2014)
Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Two Agents Competing for a Shared Machine. ADT (2013)
Ulrich Pferschy, Joachim Schauer
The maximum flow problem with disjunctive constraints. J. Comb. Optim. 26 (1) (2013)
Claudia Marini, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Strategies in competing subset selection. Ann. Oper. Res. 207 (1) (2013)
Michele Monaci, Ulrich Pferschy, Paolo Serafini
Exact solution of the robust knapsack problem. Comput. Oper. Res. 40 (11) (2013)
Michele Monaci, Ulrich Pferschy
On the Robust Knapsack Problem. SIAM J. Optim. 23 (4) (2013)
Ulrich Pferschy, Joachim Schauer
Approximating the Quadratic Knapsack Problem on Special Graph Classes. WAOA (2013)
Christian Klamler, Ulrich Pferschy, Stefan Ruzika
Committee selection under weight constraints. Math. Soc. Sci. 64 (1) (2012)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Strategies for Single-machine Multi-agent Scheduling Problems. CTW (2012)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. 159 (16) (2011)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Competitive subset selection with two agents. Discret. Appl. Math. 159 (16) (2011)
Ulrich Pferschy, Joachim Schauer
The Maximum Flow Problem with Conflict and Forcing Conditions. INOC (2011)
Michele Monaci, Ulrich Pferschy
On the Robust Knapsack Problem. CTW (2011)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
Resource allocation with time intervals. Theor. Comput. Sci. 411 (49) (2010)
Andreas Darmann, Christian Klamler, Ulrich Pferschy
A note on maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. 60 (1) (2010)
Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
The Multidimensional Knapsack Problem: Structure and Algorithms. INFORMS J. Comput. 22 (2) (2010)
Christian Klamler, Ulrich Pferschy, Stefan Ruzika
Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals. ADT (2009)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
On Multi-Agent Knapsack Problems. CTW (2009)
Andreas Darmann, Christian Klamler, Ulrich Pferschy
Maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. 58 (2) (2009)
Ulrich Pferschy, Joachim Schauer
The Knapsack Problem with Conflict Graphs. J. Graph Algorithms Appl. 13 (2) (2009)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Subset Weight Maximization with Two Competing Agents. ADT (2009)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
Determining a Minimum Spanning Tree with Disjunctive Constraints. ADT (2009)
Renata Mansini, Ulrich Pferschy
A Two-Period Portfolio Selection Model for Asset-backed Securitization. Algorithmic Oper. Res. 4 (2) (2009)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
Combinatorial Optimization Problems with Conflict Graphs. CTW (2009)
Behrooz Alizadeh, Rainer E. Burkard, Ulrich Pferschy
Inverse 1-center location problems with edge length augmentation on trees. Computing 86 (4) (2009)
Christian Klamler, Ulrich Pferschy
The traveling group problem. Soc. Choice Welf. 29 (3) (2007)
Bettina Klinz, Ulrich Pferschy, Joachim Schauer
ILP Models for a Nurse Scheduling Problem. OR (2006)
Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
The Core Concept for the Multidimensional Knapsack Problem. EvoCOP (2006)
Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Math. Program. 105 (2-3) (2006)
Daniel Wagner, Günther R. Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl
A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. OR (2006)
Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO (2005)
Alberto Caprara, Ulrich Pferschy
Modified subset sum heuristics for bin packing. Inf. Process. Lett. 96 (1) (2005)
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. GECCO (1) (2004)
Alberto Caprara, Ulrich Pferschy
Worst-case analysis of the subset sum algorithm for bin packing. Oper. Res. Lett. 32 (2) (2004)
Renata Mansini, Ulrich Pferschy
Securitization of Financial Assets: Approximation in Theory and Practice. Comput. Optim. Appl. 29 (2) (2004)
Hans Kellerer, Ulrich Pferschy
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. J. Comb. Optim. 8 (1) (2004)
Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza
An efficient fully polynomial approximation scheme for the Subset-Sum Problem. J. Comput. Syst. Sci. 66 (2) (2003)

Ulrich Pferschy.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ulrich Pferschy