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

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext

The Multidimensional Knapsack Problem: Structure and Algorithms von Puchinger, Jakob, Raidl, Gunther R, Pferschy, Ulrich

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext

Rescheduling with New Orders Under Bounded Disruption von Lendl, Stefan, Pferschy, Ulrich, Rener, Elena

Volltext

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

Volltext

A Stackelberg knapsack game with weight control von Pferschy, Ulrich, Nicosia, Gaia, Pacifici, Andrea

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext