Search Results - "Pferschy, Ulrich"

Price of Fairness for allocating a bounded resource by Nicosia, Gaia, Pacifici, Andrea, Pferschy, Ulrich

“…•We consider general multi-agent allocation problems.•We formalize a number of properties on the Price of Fairness without any special assumptions on the agent…”
Get full text

Integer programming models versus advanced planning business software for a multi-level mixed-model assembly line problem by Kreiter, Tobias, Pferschy, Ulrich

“…Many manufactures are shifting from classical production environments with large batch sizes towards mixed-model assembly lines due to increasing product…”
Get full text

Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system by Heßler, Katrin, Irnich, Stefan, Kreiter, Tobias, Pferschy, Ulrich

“…We consider a packing problem that arises in a direct-shipping system in the food and beverage industry: Trucks are the containers, and products to be…”
Get full text

Optimally rescheduling jobs with a Last-In-First-Out buffer by Nicosia, Gaia, Pacifici, Andrea, Pferschy, Ulrich, Resch, Julia, Righini, Giovanni

“…This paper considers single-machine scheduling problems in which a given solution, i.e., an ordered set of jobs, has to be improved as much as possible by…”
Get full text

Fair Allocation of Indivisible Items with Conflict Graphs by Chiarelli, Nina, Krnc, Matjaž, Milanič, Martin, Pferschy, Ulrich, Pivač, Nevena, Schauer, Joachim

“…We consider the fair allocation of indivisible items to several agents and add a graph theoretical perspective to this classical problem. Namely, we introduce…”
Get full text

Does a Graphical Abstract Bring More Visibility to Your Paper? by Pferschy-Wenzig, Eva-Maria, Pferschy, Ulrich, Wang, Dongdong, Mocan, Andrei, Atanasov, Atanas G

“…A graphical abstract (GA) represents a piece of artwork that is intended to summarize the main findings of an article for readers at a single glance. Many…”
Get full text

Paths, trees and matchings under disjunctive constraints by Darmann, Andreas, Pferschy, Ulrich, Schauer, Joachim, Woeginger, Gerhard J.

“…We study the minimum spanning tree problem, the maximum matching problem and the shortest path problem subject to binary disjunctive constraints: A negative…”
Get full text

Fair allocation algorithms for indivisible items under structured conflict constraints by Chiarelli, Nina, Krnc, Matjaž, Milanič, Martin, Pferschy, Ulrich, Schauer, Joachim

“…We consider the fair allocation of indivisible items to several agents with additional conflict constraints. These are represented by a conflict graph where…”
Get full text

Erratum: Pferschy-Wenzig, E.-M.; et al. Does a Graphical Abstract Bring More Visibility to Your Paper? Molecules 2016, 21, 1247 by Pferschy-Wenzig, Eva-Maria, Pferschy, Ulrich, Wang, Dongdong, Mocan, Andrei, Atanasov, Atanas G

“…The authors wish to make the following change to their paper [1].[...]…”
Get full text

An algorithmic framework for the exact solution of the prize-collecting steiner tree problem by LJUBIC, Ivana, WEISKIRCHER, René, PFERSCHY, Ulrich, KLAU, Gunnar W, MUTZEL, Petra, FISCHETTI, Matteo

“…The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all…”
Get full text

An efficient fully polynomial approximation scheme for the Subset-Sum Problem by Kellerer, Hans, Mansini, Renata, Pferschy, Ulrich, Speranza, Maria Grazia

“…Given a set of n positive integers and a knapsack of capacity c, the Subset-Sum Problem is to find a subset the sum of which is closest to c without exceeding…”
Get full text

Approximation of knapsack problems with conflict and forcing graphs by Pferschy, Ulrich, Schauer, Joachim

“…We study the classical 0–1 knapsack problem with additional restrictions on pairs of items. A conflict constraint states that from a certain pair of items at…”
Get full text

Optimised scheduling in human-robot collaboration - a use case in the assembly of printed circuit boards by Bogner, Karin, Pferschy, Ulrich, Unterberger, Roland, Zeiner, Herwig

“…Advances in the technologies of sensors and lightweight robots increasingly enable direct physical interaction between humans and robots. This so-called…”
Get full text

Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs by Pferschy, Ulrich, Resch, Julia, Righini, Giovanni

“…Rescheduling can help to improve the quality of a schedule with respect to an initially given sequence. In this paper, we consider the possibility of…”
Get full text

Improved dynamic programming and approximation results for the knapsack problem with setups by Pferschy, Ulrich, Scatamacchia, Rosario

“…In this paper, we consider the 0–1 knapsack problem with setups. Items are grouped into families and if any items of a family are packed, this induces a setup…”
Get full text

Corrigendum to: ‘Integer optimization with penalized fractional values: The Knapsack case’ [European Journal of Operational Research (2019) 874–888] by Malaguti, Enrico, Monaci, Michele, Paronuzzi, Paolo, Pferschy, Ulrich

Get full text

Approximation schemes for ordered vector packing problems by Caprara, Alberto, Kellerer, Hans, Pferschy, Ulrich

“…In this paper we deal with the d‐dimensional vector packing problem, which is a generalization of the classical bin packing problem in which each item has d…”
Get full text

On the Stackelberg knapsack game by Pferschy, Ulrich, Nicosia, Gaia, Pacifici, Andrea, Schauer, Joachim

“…•Considers a bilevel knapsack problem arising from a Stackelberg game setting.•Derives strong complexity and inapproximability results.•Natural Greedy-type…”
Get full text

One-dimensional stock cutting resilient against singular random defects by Arbib, Claudio, Marinelli, Fabrizio, Pferschy, Ulrich, Ranjbar, Fatemeh K.

“…When industrial components are obtained by cutting bars of raw material (stocks), production volumes and values can be affected by random defects in the…”
Get full text

The Knapsack Problem with Conflict Graphs by Pferschy, Ulrich, Schauer, Joachim

Get full text