Pferschy Ulrich

Ulrich Pferschy

Information about the author Ulrich Pferschy will soon be added to the site.
Found 14 papers in total
Strategies in competing subset selection
Strategies in competing subset selection
2013
We address an optimization problem in which two agents, each with a set of weighted...
Finding socially best spanning trees
Finding socially best spanning trees
2011
This article combines Social Choice Theory with Discrete Optimization. We assume that...
The multidimensional knapsack problem: Structure and algorithms
The multidimensional knapsack problem: Structure and algorithms
2010
We study the multidimensional knapsack problem, present some theoretical and empirical...
A two-period portfolio selection model for asset-backed securitization
A two-period portfolio selection model for asset-backed securitization
2009
Asset-Backed Securitization (ABS) is a well-stated financial mechanism which allows an...
Worst-case analysis of the subset sum algorithm for bin packing
Worst-case analysis of the subset sum algorithm for bin packing
2004
We analyze the worst-case ratio of a natural heuristic for the bin packing problem,...
Improved dynamic programming in connection with a fully polynomial time approximation scheme for the knapsack problem
Improved dynamic programming in connection with a fully polynomial time approximation scheme for the knapsack problem
2004
A vector merging problem is introduced where two vectors of length n are merged such...
Approximation schemes for ordered vector packing problems
Approximation schemes for ordered vector packing problems
2003
In this paper we deal with the d -dimensional vector packing problem, which is a...
Approximating multiobjective knapsack problems
Approximating multiobjective knapsack problems
2002
For multiobjective optimization problems, it is meaningful to compute a set of...
Cardinality constrained bin-packing problems
Cardinality constrained bin-packing problems
1999
We are concerned with a variant of the classical one-dimensional bin-packing problem....
Approximation algorithms for knapsack problems with cardinality constraints
Approximation algorithms for knapsack problems with cardinality constraints
2000
We address a variant of the classical knapsack problem in which an upper bound is...
Stochastic analysis of greedy algorithms for the subset sum problem
Stochastic analysis of greedy algorithms for the subset sum problem
1999
The subset sum problem is the selection of a subset of items from a given ground set...
The inverse-parametric knapsack problem
The inverse-parametric knapsack problem
1995
This paper deals with parametric knapsack problems where the costs or weights are...
On-line waste management in a galvanization plant
On-line waste management in a galvanization plant
1997
In this paper the authors present a case study of a waste-water treatment procedure...
Monge matrices make maximization manageable
Monge matrices make maximization manageable
1994
The authors continue the research on the effects of Monge structures in the area of...
Papers per page: