default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlrich Pferschy
Person information
- affiliation: University of Graz, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j74]Stefan Lendl
, Ulrich Pferschy, Elena Rener:
Rescheduling with New Orders Under Bounded Disruption. INFORMS J. Comput. 36(6): 1654-1675 (2024)- [j73]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): 423-617 (2024) - [j72]Nathalie Marion Frieß, Ulrich Pferschy:
Planning a zero-emission mixed-fleet public bus system with minimal life cycle cost. Public Transp. 16(1): 39-79 (2024) - [c34]Elmar Steiner, Ulrich Pferschy:
A Dynamic Algorithm Configuration Framework Using Combinatorial Problem Features and Reinforcement Learning. MIC (2) 2024: 142-157 - [i17]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 abs/2402.00921 (2024) - [i16]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Anna Russo Russo, Cecilia Salvatore:
Flow Shop Scheduling with Inter-Stage Flexibility and Blocking Constraints. CoRR abs/2411.18381 (2024) - 2023
- [j71]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica 85(5): 1459-1489 (2023) - [j70]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): 302 (2023) - [j69]Claudio Arbib, Fabrizio Marinelli, Ulrich Pferschy, Fatemeh K. Ranjbar:
One-dimensional stock cutting resilient against singular random defects. Comput. Oper. Res. 157: 106280 (2023) - [j68]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: 45-62 (2023) - [j67]Jan Boeckmann, Clemens Thielen, Ulrich Pferschy:
Approximating single- and multi-objective nonlinear sum and product knapsack problems. Discret. Optim. 48(Part 1): 100771 (2023) - [j66]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): 990 (2023) - [j65]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): 267-287 (2023) - [i15]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer:
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints. CoRR abs/2308.09399 (2023) - [i14]Francesco Corti, Balz Maag, Joachim Schauer, Ulrich Pferschy, Olga Saukh:
REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints. CoRR abs/2311.13349 (2023) - [i13]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 abs/2312.01804 (2023) - 2022
- [j64]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): 1-43 (2022) - [i12]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 abs/2202.04465 (2022) - 2021
- [j63]Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici, Joachim Schauer:
On the Stackelberg knapsack game. Eur. J. Oper. Res. 291(1): 18-31 (2021) - [j62]Ulrich Pferschy, Joachim Schauer, Clemens Thielen:
Approximating the product knapsack problem. Optim. Lett. 15(8): 2529-2540 (2021) - [j61]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini:
Optimally rescheduling jobs with a Last-In-First-Out buffer. J. Sched. 24(6): 663-680 (2021) - [c33]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: 243-257 - [c32]Nathalie Frieß, Ulrich Pferschy:
Decision-Support System for the Optimal Technology Split of a Decarbonized Bus Network. COMPSAC 2021: 1279-1284 - [i11]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini:
Optimally rescheduling jobs with a LIFO buffer. CoRR abs/2106.15901 (2021) - 2020
- [j60]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): 1141-1177 (2020) - [c31]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair Packing of Independent Sets. IWOCA 2020: 154-165 - [i10]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair packing of independent sets. CoRR abs/2003.11313 (2020)
2010 – 2019
- 2019
- [j59]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: 97-111 (2019) - [j58]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
New exact approaches and approximation results for the Penalized Knapsack Problem. Discret. Appl. Math. 253: 122-135 (2019) - [j57]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
On approximating the Incremental Knapsack Problem. Discret. Appl. Math. 264: 26-42 (2019) - [j56]Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, Ulrich Pferschy:
Integer optimization with penalized fractional values: The Knapsack case. Eur. J. Oper. Res. 273(3): 874-888 (2019) - [j55]Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici:
A Stackelberg knapsack game with weight control. Theor. Comput. Sci. 799: 149-159 (2019) - [i9]Ulrich Pferschy, Joachim Schauer, Clemens Thielen:
The Product Knapsack Problem: Approximation and Complexity. CoRR abs/1901.00695 (2019) - 2018
- [j54]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Competitive multi-agent scheduling with an iterative selection rule. 4OR 16(1): 15-29 (2018) - [j53]Ulrich Pferschy, Joachim Schauer:
Order Batching and Routing in a Non-Standard Warehouse. Electron. Notes Discret. Math. 69: 125-132 (2018) - [j52]Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici:
On a Stackelberg Subset Sum Game. Electron. Notes Discret. Math. 69: 133-140 (2018) - [j51]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): 5522-5540 (2018) - [j50]Ulrich Pferschy, Rosario Scatamacchia:
Improved dynamic programming and approximation results for the knapsack problem with setups. Int. Trans. Oper. Res. 25(2): 667-682 (2018) - [j49]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximating the 3-period Incremental Knapsack Problem. J. Discrete Algorithms 52-53: 55-69 (2018) - [i8]Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici:
On a Stackelberg Subset Sum Game. CoRR abs/1801.03698 (2018) - [i7]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximating the Incremental Knapsack Problem. CoRR abs/1801.04801 (2018) - [i6]Rostislav Stanek, Peter Greistorfer, Klaus Ladner, Ulrich Pferschy:
Geometric and LP-based heuristics for the quadratic travelling salesman problem. CoRR abs/1803.03681 (2018) - 2017
- [j48]Ulrich Pferschy, Rostislav Stanek:
Generating subtour elimination constraints for the TSP from pure integer solutions. Central Eur. J. Oper. Res. 25(1): 231-260 (2017) - [j47]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
On the Shortest Path Game. Discret. Appl. Math. 217: 3-18 (2017) - [j46]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
The shortest connection game. Discret. Appl. Math. 231: 139-154 (2017) - [j45]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Price of Fairness for allocating a bounded resource. Eur. J. Oper. Res. 257(3): 933-943 (2017) - [j44]Ulrich Pferschy, Joachim Schauer:
Approximation of knapsack problems with conflict and forcing graphs. J. Comb. Optim. 33(4): 1300-1323 (2017) - [c30]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximation Results for the Incremental Knapsack Problem. IWOCA 2017: 75-87 - [i5]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 abs/1702.04211 (2017) - 2016
- [j43]Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Maximin Fairness in Project Budget Allocation. Electron. Notes Discret. Math. 55: 65-68 (2016) - [j42]Anja Fischer, J. Fabian Meier, Ulrich Pferschy, Rostislav Stanek:
Linear Models and Computational Experiments for the Quadratic TSP. Electron. Notes Discret. Math. 55: 97-100 (2016) - [j41]Ulrich Pferschy, Joachim Schauer:
Approximation of the Quadratic Knapsack Problem. INFORMS J. Comput. 28(2): 308-318 (2016) - [c29]Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Maximin Fairness-profit Tradeoff in Project Budget Allocation. CENTERIS/ProjMAN/HCist 2016: 313-320 - [c28]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: 85-90 - 2015
- [j40]Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Scheduling two agent task chains with a central selection mechanism. J. Sched. 18(3): 243-261 (2015) - [j39]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Two agent scheduling with a central selection mechanism. Theor. Comput. Sci. 596: 109-123 (2015) - [c27]Tobias Kreiter, Ulrich Pferschy, Joachim Schauer:
Personnel Planning with Multi-tasking and Structured Qualifications. OR 2015: 597-603 - [c26]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Brief Announcement: On the Fair Subset Sum Problem. SAGT 2015: 309-311 - [i4]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Price of Fairness for Multiagent Subset Sum Problems. CTW 2015: 55-58 - [i3]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
On the shortest path game: extended version. CoRR abs/1506.00462 (2015) - [i2]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Price of Fairness for Allocating a Bounded Resource. CoRR abs/1508.05253 (2015) - [i1]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
The Shortest Connection Game. CoRR abs/1511.07847 (2015) - 2014
- [j38]Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, Joachim Schauer:
The Subset Sum game. Eur. J. Oper. Res. 233(3): 539-549 (2014) - [c25]Ulrich Pferschy, Joachim Schauer, Gerhild Maier:
A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign. ICORES (Selected Papers) 2014: 251-264 - [c24]Ulrich Pferschy, Joachim Schauer, Gerhild Maier:
Media Mix Optimization - Applying a Quadratic Knapsack Model. ICORES 2014: 363-370 - [c23]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
The Shortest Path Game: Complexity and Algorithms. IFIP TCS 2014: 39-53 - 2013
- [j37]Claudia Marini, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Strategies in competing subset selection. Ann. Oper. Res. 207(1): 181-200 (2013) - [j36]Michele Monaci, Ulrich Pferschy, Paolo Serafini:
Exact solution of the robust knapsack problem. Comput. Oper. Res. 40(11): 2625-2631 (2013) - [j35]Ulrich Pferschy, Joachim Schauer:
The maximum flow problem with disjunctive constraints. J. Comb. Optim. 26(1): 109-119 (2013) - [j34]Michele Monaci, Ulrich Pferschy:
On the Robust Knapsack Problem. SIAM J. Optim. 23(4): 1956-1982 (2013) - [c22]Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Two Agents Competing for a Shared Machine. ADT 2013: 1-14 - [c21]Ulrich Pferschy, Joachim Schauer:
Approximating the Quadratic Knapsack Problem on Special Graph Classes. WAOA 2013: 61-72 - 2012
- [j33]Christian Klamler, Ulrich Pferschy, Stefan Ruzika:
Committee selection under weight constraints. Math. Soc. Sci. 64(1): 48-56 (2012) - [c20]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Strategies for Single-machine Multi-agent Scheduling Problems. CTW 2012: 197-200 - 2011
- [j32]Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger:
Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. 159(16): 1726-1735 (2011) - [j31]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Competitive subset selection with two agents. Discret. Appl. Math. 159(16): 1865-1877 (2011) - [c19]Michele Monaci, Ulrich Pferschy:
On the Robust Knapsack Problem. CTW 2011: 207-210 - [c18]Ulrich Pferschy, Joachim Schauer:
The Maximum Flow Problem with Conflict and Forcing Conditions. INOC 2011: 289-294 - 2010
- [j30]Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy:
The Multidimensional Knapsack Problem: Structure and Algorithms. INFORMS J. Comput. 22(2): 250-265 (2010) - [j29]Andreas Darmann, Christian Klamler, Ulrich Pferschy:
A note on maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. 60(1): 82-85 (2010) - [j28]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
Resource allocation with time intervals. Theor. Comput. Sci. 411(49): 4217-4234 (2010)
2000 – 2009
- 2009
- [j27]Renata Mansini, Ulrich Pferschy:
A Two-Period Portfolio Selection Model for Asset-backed Securitization. Algorithmic Oper. Res. 4(2): 155-170 (2009) - [j26]Behrooz Alizadeh, Rainer E. Burkard, Ulrich Pferschy:
Inverse 1-center location problems with edge length augmentation on trees. Computing 86(4): 331-343 (2009) - [j25]Ulrich Pferschy, Joachim Schauer:
The Knapsack Problem with Conflict Graphs. J. Graph Algorithms Appl. 13(2): 233-249 (2009) - [j24]Andreas Darmann, Christian Klamler, Ulrich Pferschy:
Maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. 58(2): 238-250 (2009) - [c17]Christian Klamler, Ulrich Pferschy, Stefan Ruzika:
Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals. ADT 2009: 50-61 - [c16]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Subset Weight Maximization with Two Competing Agents. ADT 2009: 74-85 - [c15]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
Determining a Minimum Spanning Tree with Disjunctive Constraints. ADT 2009: 414-423 - [c14]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
On Multi-Agent Knapsack Problems. CTW 2009: 44-47 - [c13]Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger:
Combinatorial Optimization Problems with Conflict Graphs. CTW 2009: 293-296 - 2007
- [j23]Christian Klamler, Ulrich Pferschy:
The traveling group problem. Soc. Choice Welf. 29(3): 429-452 (2007) - 2006
- [j22]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): 427-449 (2006) - [c12]Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy:
The Core Concept for the Multidimensional Knapsack Problem. EvoCOP 2006: 195-208 - [c11]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: 197-202 - [c10]Bettina Klinz, Ulrich Pferschy, Joachim Schauer:
ILP Models for a Nurse Scheduling Problem. OR 2006: 319-324 - 2005
- [j21]Alberto Caprara, Ulrich Pferschy:
Modified subset sum heuristics for bin packing. Inf. Process. Lett. 96(1): 18-23 (2005) - [c9]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: 68-76 - 2004
- [b1]Hans Kellerer, Ulrich Pferschy, David Pisinger:
Knapsack problems. Springer 2004, ISBN 978-3-540-40286-2, pp. I-XX, 1-546 - [j20]Renata Mansini, Ulrich Pferschy:
Securitization of Financial Assets: Approximation in Theory and Practice. Comput. Optim. Appl. 29(2): 147-171 (2004) - [j19]Hans Kellerer, Ulrich Pferschy:
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. J. Comb. Optim. 8(1): 5-11 (2004) - [j18]Alberto Caprara, Ulrich Pferschy:
Worst-case analysis of the subset sum algorithm for bin packing. Oper. Res. Lett. 32(2): 159-166 (2004) - [c8]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: 1304-1315 - 2003
- [j17]Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
A 3/4-Approximation Algorithm for Multiple Subset Sum. J. Heuristics 9(2): 99-111 (2003) - [j16]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): 349-370 (2003) - [c7]Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher:
The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. ESA 2003: 691-702 - 2002
- [j15]Thomas Erlebach, Hans Kellerer, Ulrich Pferschy:
Approximating Multiobjective Knapsack Problems. Manag. Sci. 48(12): 1603-1612 (2002) - 2001
- [c6]Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
Approximation Schemes for Ordered Vector Packing Problems. RANDOM-APPROX 2001: 63-74 - [c5]Thomas Erlebach, Hans Kellerer, Ulrich Pferschy:
Approximating Multi-objective Knapsack Problems. WADS 2001: 210-221 - 2000
- [j14]Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger:
Approximation algorithms for knapsack problems with cardinality constraints. Eur. J. Oper. Res. 123(2): 333-345 (2000) - [j13]Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. Inf. Process. Lett. 73(3-4): 111-118 (2000) - [j12]Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
The Multiple Subset Sum Problem. SIAM J. Optim. 11(2): 308-319 (2000)
1990 – 1999
- 1999
- [j11]Hans Kellerer, Ulrich Pferschy:
Cardinality constrained bin‐packing problems. Ann. Oper. Res. 92: 335-348 (1999) - [j10]Ulrich Pferschy:
Dynamic Programming Revisited: Improving Knapsack Algorithms. Computing 63(4): 419-430 (1999) - [j9]Hans Kellerer, Ulrich Pferschy:
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. J. Comb. Optim. 3(1): 59-71 (1999) - 1998
- [c4]Hans Kellerer, Ulrich Pferschy:
A New Fully Polynomial Approximation Scheme for the Knapsack Problem. APPROX 1998: 123-134 - 1997
- [j8]Ulrich Pferschy:
Solution Methods and Computational Investigations for the Linear Bottleneck Assignment Problem. Computing 59(3): 237-258 (1997) - [j7]Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger:
Simple But Efficient Approaches for the Collapsing Knapsack Problem. Discret. Appl. Math. 77(3): 271-280 (1997) - [j6]József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger:
Greedy Algorithms for On-Line Data Compression. J. Algorithms 25(2): 274-289 (1997) - [c3]Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza:
An Efficient Approximation Scheme for the Subset-Sum Problem. ISAAC 1997: 394-403 - 1996
- [j5]József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger:
The Fractional Greedy Algorithm for Data Compression. Computing 56(1): 29-46 (1996) - 1995
- [c2]József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger:
Worst-Case Analysis for On-Line Data Compression. Combinatorics and Computer Science 1995: 288-300 - [c1]Ulrich Pferschy:
The Random Linear Bottleneck Assignment Problem. IPCO 1995: 145-156 - 1994
- [j4]Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao:
Partitioning Graphs into Two Trees. Acta Cybern. 11(3): 233-240 (1994) - [j3]Ulrich Pferschy, Hoang Tuy:
Linear programs with an additional rank two reverse convex constraint. J. Glob. Optim. 4(4): 441-454 (1994) - [j2]Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger:
Some Geometric Clustering Problems. Nord. J. Comput. 1(2): 246-263 (1994) - [j1]Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger:
Monge matrices make maximization manageable. Oper. Res. Lett. 16(5): 245-254 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 19:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
