List of works - Ulrich Pferschy

A Stackelberg knapsack game with weight control ⬇️

scholarly article

A note on maximizing the minimum voter satisfaction on spanning trees

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

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

Approximation algorithms for knapsack problems with cardinality constraints

Approximation of knapsack problems with conflict and forcing graphs

Approximation schemes for ordered vector packing problems

scholarly article by Alberto Caprara et al published 13 January 2003 in Naval Research Logistics

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

Committee selection under weight constraints

Competitive multi-agent scheduling with an iterative selection rule

Competitive subset selection with two agents

Determining a Minimum Spanning Tree with Disjunctive Constraints

Does a Graphical Abstract Bring More Visibility to Your Paper?

scientific article

Erratum: Pferschy-Wenzig, E.-M.; et al. Does a Graphical Abstract Bring More Visibility to Your Paper? Molecules 2016, 21, 1247

article

Exact solution of the robust knapsack problem

scientific article published on November 2013

Finding socially best spanning trees

Generating subtour elimination constraints for the TSP from pure integer solutions

scientific article

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

Influence of production costs on cutting optimization in window frame production—A graph-theoretical model

article

Integer optimization with penalized fractional values: The Knapsack case

Integer programming models versus advanced planning business software for a multi-level mixed-model assembly line problem

scholarly article

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

Knapsack Problems

book by Hans Kellerer

Linear programs with an additional rank two reverse convex constraint

Maximizing the minimum voter satisfaction on spanning trees

Modified subset sum heuristics for bin packing

scholarly article by Alberto Caprara & Ulrich Pferschy published October 2005 in Information Processing Letters

New exact approaches and approximation results for the Penalized Knapsack Problem

On the Shortest Path Game

Paths, trees and matchings under disjunctive constraints

Price of Fairness for allocating a bounded resource ⬇️

Profit-fairness trade-off in project selection

Resource allocation with time intervals

Securitization of Financial Assets: Approximation in Theory and Practice

Simple but efficient approaches for the collapsing knapsack problem

article by Ulrich Pferschy et al published August 1997 in Discrete Applied Mathematics

Strategies in competing subset selection

Subset Weight Maximization with Two Competing Agents

The Core Concept for the Multidimensional Knapsack Problem

The Maximum Flow Problem with Conflict and Forcing Conditions

The Multidimensional Knapsack Problem: Structure and Algorithms

The Multiple Subset Sum Problem

article published in 2000

The Subset Sum game.

scientific article published on March 2014

List of works by Ulrich Pferschy