Ulrich Pferschy

According to our database1, Ulrich Pferschy authored at least 94 papers between 1994 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Integer programming models versus advanced planning business software for a multi-level mixed-model assembly line problem.
Central Eur. J. Oper. Res., 2020

Fair Packing of Independent Sets.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019
A Stackelberg knapsack game with weight control.
Theor. Comput. Sci., 2019

Integer optimization with penalized fractional values: The Knapsack case.
Eur. J. Oper. Res., 2019

On approximating the Incremental Knapsack Problem.
Discret. Appl. Math., 2019

New exact approaches and approximation results for the Penalized Knapsack Problem.
Discret. Appl. Math., 2019

The Product Knapsack Problem: Approximation and Complexity.
CoRR, 2019

Geometric and LP-based heuristics for angular travelling salesman problems in the plane.
Comput. Oper. Res., 2019

2018
Approximating the 3-period Incremental Knapsack Problem.
J. Discrete Algorithms, 2018

Improved dynamic programming and approximation results for the knapsack problem with setups.
Int. Trans. Oper. Res., 2018

Order Batching and Routing in a Non-Standard Warehouse.
Electron. Notes Discret. Math., 2018

On a Stackelberg Subset Sum Game.
Electron. Notes Discret. Math., 2018

Geometric and LP-based heuristics for the quadratic travelling salesman problem.
CoRR, 2018

Competitive multi-agent scheduling with an iterative selection rule.
4OR, 2018

2017
Approximation of knapsack problems with conflict and forcing graphs.
J. Comb. Optim., 2017

Price of Fairness for allocating a bounded resource.
Eur. J. Oper. Res., 2017

The shortest connection game.
Discret. Appl. Math., 2017

On the Shortest Path Game.
Discret. Appl. Math., 2017

Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem.
CoRR, 2017

Generating subtour elimination constraints for the TSP from pure integer solutions.
Central Eur. J. Oper. Res., 2017

Approximation Results for the Incremental Knapsack Problem.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016
Approximation of the Quadratic Knapsack Problem.
INFORMS J. Comput., 2016

Maximin Fairness in Project Budget Allocation.
Electron. Notes Discret. Math., 2016

Linear Models and Computational Experiments for the Quadratic TSP.
Electron. Notes Discret. Math., 2016

A Simulation study of Fairness-Profit Trade-off in Project Selection based on HHI and Knapsack Models.
Proceedings of the 2016 European Modelling Symposium, 2016

2015
Two agent scheduling with a central selection mechanism.
Theor. Comput. Sci., 2015

Scheduling two agent task chains with a central selection mechanism.
J. Sched., 2015

On the shortest path game: extended version.
CoRR, 2015

Brief Announcement: On the Fair Subset Sum Problem.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Personnel Planning with Multi-tasking and Structured Qualifications.
Proceedings of the Operations Research Proceedings 2015, 2015

Price of Fairness for Multiagent Subset Sum Problems.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
The Subset Sum game.
Eur. J. Oper. Res., 2014

The Shortest Path Game: Complexity and Algorithms.
Proceedings of the Theoretical Computer Science, 2014

A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign.
Proceedings of the Operations Research and Enterprise Systems, 2014

Media Mix Optimization - Applying a Quadratic Knapsack Model.
Proceedings of the ICORES 2014, 2014

2013
On the Robust Knapsack Problem.
SIAM J. Optim., 2013

The maximum flow problem with disjunctive constraints.
J. Comb. Optim., 2013

Exact solution of the robust knapsack problem.
Comput. Oper. Res., 2013

Strategies in competing subset selection.
Ann. Oper. Res., 2013

Approximating the Quadratic Knapsack Problem on Special Graph Classes.
Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Two Agents Competing for a Shared Machine.
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012
Committee selection under weight constraints.
Math. Soc. Sci., 2012

Strategies for Single-machine Multi-agent Scheduling Problems.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
Competitive subset selection with two agents.
Discret. Appl. Math., 2011

Paths, trees and matchings under disjunctive constraints.
Discret. Appl. Math., 2011

The Maximum Flow Problem with Conflict and Forcing Conditions.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
Resource allocation with time intervals.
Theor. Comput. Sci., 2010

A note on maximizing the minimum voter satisfaction on spanning trees.
Math. Soc. Sci., 2010

The Multidimensional Knapsack Problem: Structure and Algorithms.
INFORMS J. Comput., 2010

2009
Maximizing the minimum voter satisfaction on spanning trees.
Math. Soc. Sci., 2009

The Knapsack Problem with Conflict Graphs.
J. Graph Algorithms Appl., 2009

Inverse 1-center location problems with edge length augmentation on trees.
Computing, 2009

A Two-Period Portfolio Selection Model for Asset-backed Securitization.
Algorithmic Oper. Res., 2009

On Multi-Agent Knapsack Problems.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Combinatorial Optimization Problems with Conflict Graphs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Subset Weight Maximization with Two Competing Agents.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

Determining a Minimum Spanning Tree with Disjunctive Constraints.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2007
The traveling group problem.
Soc. Choice Welf., 2007

2006
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.
Math. Program., 2006

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks.
Proceedings of the Operations Research, 2006

ILP Models for a Nurse Scheduling Problem.
Proceedings of the Operations Research, 2006

The Core Concept for the Multidimensional Knapsack Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

2005
Modified subset sum heuristics for bin packing.
Inf. Process. Lett., 2005

Solving the Prize-Collecting Steiner Tree Problem to Optimality.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
Worst-case analysis of the subset sum algorithm for bin packing.
Oper. Res. Lett., 2004

Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem.
J. Comb. Optim., 2004

Securitization of Financial Assets: Approximation in Theory and Practice.
Comput. Optim. Appl., 2004

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.
Proceedings of the Genetic and Evolutionary Computation, 2004

Knapsack problems.
Springer, ISBN: 978-3-540-40286-2, 2004

2003
An efficient fully polynomial approximation scheme for the Subset-Sum Problem.
J. Comput. Syst. Sci., 2003

A 3/4-Approximation Algorithm for Multiple Subset Sum.
J. Heuristics, 2003

The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract.
Proceedings of the Algorithms, 2003

2002
Approximating Multiobjective Knapsack Problems.
Manag. Sci., 2002

2001
Approximating Multi-objective Knapsack Problems.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Approximation Schemes for Ordered Vector Packing Problems.
Proceedings of the Approximation, 2001

2000
The Multiple Subset Sum Problem.
SIAM J. Optim., 2000

A PTAS for the Multiple Subset Sum Problem with different knapsack capacities.
Inf. Process. Lett., 2000

Approximation algorithms for knapsack problems with cardinality constraints.
Eur. J. Oper. Res., 2000

1999
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem.
J. Comb. Optim., 1999

Dynamic Programming Revisited: Improving Knapsack Algorithms.
Computing, 1999

Cardinality constrained bin‐packing problems.
Ann. Oper. Res., 1999

1998
A New Fully Polynomial Approximation Scheme for the Knapsack Problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997
Greedy Algorithms for On-Line Data Compression.
J. Algorithms, 1997

Simple But Efficient Approaches for the Collapsing Knapsack Problem.
Discret. Appl. Math., 1997

Solution Methods and Computational Investigations for the Linear Bottleneck Assignment Problem.
Computing, 1997

An Efficient Approximation Scheme for the Subset-Sum Problem.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996
The Fractional Greedy Algorithm for Data Compression.
Computing, 1996

1995
The Random Linear Bottleneck Assignment Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Worst-Case Analysis for On-Line Data Compression.
Proceedings of the Combinatorics and Computer Science, 1995

1994
Monge matrices make maximization manageable.
Oper. Res. Lett., 1994

Some Geometric Clustering Problems.
Nord. J. Comput., 1994

Linear programs with an additional rank two reverse convex constraint.
J. Glob. Optim., 1994

Partitioning Graphs into Two Trees.
Acta Cybern., 1994


  Loading...