Woeginger Gerhard J

Gerhard J Woeginger

Information about the author Gerhard J Woeginger will soon be added to the site.
Found 10 papers in total
Approximability and parameterized complexity of multicover by c-intervals
Approximability and parameterized complexity of multicover by c-intervals
2015
A c ‐interval is the disjoint union of c intervals over ‐ N . The c...
Geometric versions of the three-dimensional assignment problem under general norms
Geometric versions of the three-dimensional assignment problem under general norms
2015
We discuss the computational complexity of special cases of the...
A well‐solvable special case of the bounded knapsack problem
A well‐solvable special case of the bounded knapsack problem
2011
We identify a polynomially solvable special case of the bounded knapsack problem that...
Exponential size neighborhoods for makespan minimization scheduling
Exponential size neighborhoods for makespan minimization scheduling
2011
We investigate the quality of local search heuristics for the scheduling problem of...
Charlemagne's Challenge: The Periodic Latency Problem
Charlemagne's Challenge: The Periodic Latency Problem
2011
Latency problems are characterized by their focus on minimizing the waiting time for...
Unbounded knapsack problems with arithmetic weight sequences
Unbounded knapsack problems with arithmetic weight sequences
2011
We investigate a special case of the unbounded knapsack problem in which the item...
The Wiener maximum quadratic assignment problem
The Wiener maximum quadratic assignment problem
2011
We investigate a special case of the maximum quadratic assignment problem where one...
The hardness of train rearrangements
The hardness of train rearrangements
2009
We derive several results on the computational complexity of train rearrangement...
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
2008
The following minimization problem is shown to be NP-hard: Given a graphic degree...
The approximability of three-dimensional assignment problems with bottleneck objective
The approximability of three-dimensional assignment problems with bottleneck objective
2009
We discuss two special cases of the three-dimensional bottleneck assignment problem...
Papers per page: