2 citations · 3 across the 3 of their papers we have counts for
3 papers · 1 filter
Characterizations and Directed Path-Width of Sequence Digraphs
Frank Gurski, Carolin Rehs, Jochen Rethmann
Computing the directed path-width of a directed graph is an NP-hard problem. Even for digraphs of maximum semi-degree 3 the problem remains hard. We propose a decomposition of an i…
Integer Programming Models and Parameterized Algorithms for Controlling Palletizers
Frank Gurski, Jochen Rethmann, Egon Wanke
We study the combinatorial FIFO Stack-Up problem, where bins have to be stacked-up from conveyor belts onto pallets. Given k sequences of labeled bins and a positive integer p, the…
Complexity of the FIFO Stack-Up Problem
Frank Gurski, Jochen Rethmann, Egon Wanke
We study the combinatorial FIFO stack-up problem. In delivery industry, bins have to be stacked-up from conveyor belts onto pallets with respect to customer orders. Given k sequenc…