Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Ulrich
Last name:	Pferschy
DBLP:	17/5591
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 34  

Select a publication
Show	Title	Venue	Rating	Date
	Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger. Combinatorial Optimization Problems with Conflict Graphs.	Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009 2009	(0)	2009
	Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy. On Multi-Agent Knapsack Problems.	Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009 2009	(0)	2009
	Andreas Darmann, Ulrich Pferschy, Joachim Schauer. Determining a Minimum Spanning Tree with Disjunctive Constraints.	Algorithmic Decision Theory, First International Conference, ADT 2009, Venice, Italy, October 20-23, 2009. Proceedings 2009	(0)	2009
	Christian Klamler, Ulrich Pferschy, Stefan Ruzika. Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals.	Algorithmic Decision Theory, First International Conference, ADT 2009, Venice, Italy, October 20-23, 2009. Proceedings 2009	(0)	2009
	Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy. Subset Weight Maximization with Two Competing Agents.	Algorithmic Decision Theory, First International Conference, ADT 2009, Venice, Italy, October 20-23, 2009. Proceedings 2009	(0)	2009
	Behrooz Alizadeh, Rainer E. Burkard, Ulrich Pferschy. Inverse 1-center location problems with edge length augmentation on trees.	Computing 2009, Volume 86	(0)	2009
	Ulrich Pferschy, Joachim Schauer. The Knapsack Problem with Conflict Graphs.	J. Graph Algorithms Appl. 2009, Volume 13	(0)	2009
	Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy. The Core Concept for the Multidimensional Knapsack Problem.	Evolutionary Computation in Combinatorial Optimization, 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings 2006	(0)	2006
	Bettina Klinz, Ulrich Pferschy, Joachim Schauer. ILP Models for a Nurse Scheduling Problem.	Operations Research, Proceedings 2006, Selected Papers of the Annual International Conference of the German Operations ResearchSociety (GOR), Jointly Organized with the Austrian Society of Operations Research (ÖGOR) and the Swiss Society of Operation 2007	(0)	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.	Operations Research, Proceedings 2006, Selected Papers of the Annual International Conference of the German Operations ResearchSociety (GOR), Jointly Organized with the Austrian Society of Operations Research (ÖGOR) and the Swiss Society of Operation 2007	(0)	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. 2006, Volume 105	(0)	2006
	Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti. 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, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005 2005	(0)	2005
	Alberto Caprara, Ulrich Pferschy. Modified subset sum heuristics for bin packing.	Inf. Process. Lett. 2005, Volume 96	(0)	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.	Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part I 2004	(0)	2004
	Hans Kellerer, Ulrich Pferschy. Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem.	J. Comb. Optim. 2004, Volume 8	(0)	2004
	Alberto Caprara, Ulrich Pferschy. Worst-case analysis of the subset sum algorithm for bin packing.	Oper. Res. Lett. 2004, Volume 32	(0)	2004
	Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher. The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract.	Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings 2003	(0)	2003
	Alberto Caprara, Hans Kellerer, Ulrich Pferschy. A 3/4-Approximation Algorithm for Multiple Subset Sum.	J. Heuristics 2003, Volume 9	(0)	2003
	Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza. An efficient fully polynomial approximation scheme for the Subset-Sum Problem.	J. Comput. Syst. Sci. 2003, Volume 66	(0)	2003
	Alberto Caprara, Hans Kellerer, Ulrich Pferschy. Approximation Schemes for Ordered Vector Packing Problems.	Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approxi 2001	(0)	2001
	Thomas Erlebach, Hans Kellerer, Ulrich Pferschy. Approximating Multi-objective Knapsack Problems.	Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings 2001	(0)	2001
	Alberto Caprara, Hans Kellerer, Ulrich Pferschy. A PTAS for the Multiple Subset Sum Problem with different knapsack capacities.	Inf. Process. Lett. 2000, Volume 73	(0)	2000
	Ulrich Pferschy. Dynamic Programming Revisited: Improving Knapsack Algorithms.	Computing 1999, Volume 63	(0)	1999
	Hans Kellerer, Ulrich Pferschy. A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem.	J. Comb. Optim. 1999, Volume 3	(0)	1999
	Hans Kellerer, Ulrich Pferschy. A New Fully Polynomial Approximation Scheme for the Knapsack Problem.	Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings 1998	(0)	1998

Your query returned 34 matches in the database.