Ulrich Pferschy

Theor. Comput. Sci., 2015

Scheduling two agent task chains with a central selection mechanism.

[BibT_eX]

[DOI]

J. Sched., 2015

On the shortest path game: extended version.

[BibT_eX]

[DOI]

CoRR, 2015

Brief Announcement: On the Fair Subset Sum Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Personnel Planning with Multi-tasking and Structured Qualifications.

[BibT_eX]

[DOI]

Tobias Kreiter

Proceedings of the Operations Research Proceedings 2015, 2015

Price of Fairness for Multiagent Subset Sum Problems.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

The Subset Sum game.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

The Shortest Path Game: Complexity and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2014

A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign.

[BibT_eX]

[DOI]

Gerhild Maier

Proceedings of the Operations Research and Enterprise Systems, 2014

Media Mix Optimization - Applying a Quadratic Knapsack Model.

[BibT_eX]

[DOI]

Gerhild Maier

Proceedings of the ICORES 2014, 2014

2013

On the Robust Knapsack Problem.

[BibT_eX]

[DOI]

Michele Monaci

SIAM J. Optim., 2013

The maximum flow problem with disjunctive constraints.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

Exact solution of the robust knapsack problem.

[BibT_eX]

[DOI]

Michele Monaci

Paolo Serafini

Comput. Oper. Res., 2013

Strategies in competing subset selection.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2013

Approximating the Quadratic Knapsack Problem on Special Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Two Agents Competing for a Shared Machine.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012

Committee selection under weight constraints.

[BibT_eX]

[DOI]

Stefan Ruzika

Math. Soc. Sci., 2012

Strategies for Single-machine Multi-agent Scheduling Problems.

[BibT_eX]

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Competitive subset selection with two agents.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Paths, trees and matchings under disjunctive constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

The Maximum Flow Problem with Conflict and Forcing Conditions.

[BibT_eX]

[DOI]

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

Resource allocation with time intervals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

A note on maximizing the minimum voter satisfaction on spanning trees.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2010

The Multidimensional Knapsack Problem: Structure and Algorithms.

[BibT_eX]

[DOI]

Jakob Puchinger

Günther R. Raidl

INFORMS J. Comput., 2010

2009

Maximizing the minimum voter satisfaction on spanning trees.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2009

The Knapsack Problem with Conflict Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

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

[BibT_eX]

[DOI]

Behrooz Alizadeh

Rainer E. Burkard

Computing, 2009

A Two-Period Portfolio Selection Model for Asset-backed Securitization.

[BibT_eX]

[DOI]

Renata Mansini

Algorithmic Oper. Res., 2009

On Multi-Agent Knapsack Problems.

[BibT_eX]

[DOI]

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

Combinatorial Optimization Problems with Conflict Graphs.

[BibT_eX]

[DOI]

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

Subset Weight Maximization with Two Competing Agents.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals.

[BibT_eX]

[DOI]

Stefan Ruzika

Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

Determining a Minimum Spanning Tree with Disjunctive Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2007

The traveling group problem.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2007

2006

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.

[BibT_eX]

[DOI]

Math. Program., 2006

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks.

[BibT_eX]

[DOI]

Proceedings of the Operations Research, 2006

ILP Models for a Nurse Scheduling Problem.

[BibT_eX]

[DOI]

Bettina Klinz

Proceedings of the Operations Research, 2006

The Core Concept for the Multidimensional Knapsack Problem.

[BibT_eX]

[DOI]

Jakob Puchinger

Günther R. Raidl

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

2005

Modified subset sum heuristics for bin packing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Solving the Prize-Collecting Steiner Tree Problem to Optimality.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2004

Securitization of Financial Assets: Approximation in Theory and Practice.

[BibT_eX]

[DOI]

Renata Mansini

Comput. Optim. Appl., 2004

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation, 2004

Knapsack problems.

[BibT_eX]

[DOI]

David Pisinger

Springer, ISBN: 978-3-540-40286-2, 2004

2003

An efficient fully polynomial approximation scheme for the Subset-Sum Problem.

[BibT_eX]

[DOI]

Renata Mansini

Maria Grazia Speranza

J. Comput. Syst. Sci., 2003

A 3/4-Approximation Algorithm for Multiple Subset Sum.

[BibT_eX]

[DOI]

J. Heuristics, 2003

The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Approximating Multiobjective Knapsack Problems.

[BibT_eX]

[DOI]

Thomas Erlebach

Manag. Sci., 2002

2001

Approximating Multi-objective Knapsack Problems.

[BibT_eX]

[DOI]

Thomas Erlebach

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Approximation Schemes for Ordered Vector Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

2000

The Multiple Subset Sum Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2000

A PTAS for the Multiple Subset Sum Problem with different knapsack capacities.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Approximation algorithms for knapsack problems with cardinality constraints.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

1999

A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 1999

Dynamic Programming Revisited: Improving Knapsack Algorithms.

[BibT_eX]

[DOI]

Computing, 1999

Cardinality constrained bin‐packing problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1999

1998

A New Fully Polynomial Approximation Scheme for the Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997

Greedy Algorithms for On-Line Data Compression.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Simple But Efficient Approaches for the Collapsing Knapsack Problem.

[BibT_eX]

[DOI]

David Pisinger

Discret. Appl. Math., 1997

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

[BibT_eX]

[DOI]

Computing, 1997

An Efficient Approximation Scheme for the Subset-Sum Problem.

[BibT_eX]

[DOI]

Maria Grazia Speranza

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996

The Fractional Greedy Algorithm for Data Compression.

[BibT_eX]

[DOI]

Computing, 1996

1995

The Random Linear Bottleneck Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Worst-Case Analysis for On-Line Data Compression.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics and Computer Science, 1995

1994

Monge matrices make maximization manageable.

[BibT_eX]

[DOI]

Rüdiger Rudolf

Oper. Res. Lett., 1994

Some Geometric Clustering Problems.

[BibT_eX]

Rüdiger Rudolf

Nord. J. Comput., 1994

Linear programs with an additional rank two reverse convex constraint.

[BibT_eX]

[DOI]

Hoang Tuy

J. Glob. Optim., 1994

Partitioning Graphs into Two Trees.

[BibT_eX]

[DOI]