| Publication | Date of Publication | Type |
|---|
| Truly tight bounds for TSP heuristics | 2023-09-12 | Paper |
| Local improvement algorithms for a path packing problem: a performance analysis based on linear programming | 2021-04-07 | Paper |
| Column generation based heuristic for learning classification trees | 2020-01-27 | Paper |
| Integer programming models for mid-term production planning for high-tech low-volume supply chains | 2018-05-17 | Paper |
| Coloring graphs using two colors while avoiding monochromatic cycles | 2016-06-29 | Paper |
| Stable multi-skill workforce assignments | 2014-09-26 | Paper |
| Realizing Small Tournaments Through Few Permutations | 2014-05-05 | Paper |
| An improved MIP-based approach for a multi-skill workforce scheduling problem | 2014-02-05 | Paper |
| Complexity and approximation of an area packing problem | 2012-11-30 | Paper |
| An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007 | 2012-11-15 | Paper |
| Cinderella versus the Wicked Stepmother | 2012-09-21 | Paper |
| Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop | 2012-06-08 | Paper |
| Experimental comparison of approximation algorithms for scheduling unrelated parallel machines | 2012-05-30 | Paper |
| The Alcuin number of a graph and its connections to the vertex cover number | 2012-04-05 | Paper |
| The Cinderella Game on Holes and Anti-holes | 2011-12-16 | Paper |
| How Cinderella Won the Bucket Game (and Lived Happily Ever After) | 2011-12-07 | Paper |
| A REVERSIBLE ERLANG LOSS SYSTEM WITH MULTITYPE CUSTOMERS AND MULTITYPE SERVERS | 2011-08-17 | Paper |
| The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number | 2011-06-17 | Paper |
| Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles | 2010-07-20 | Paper |
| The c game revisited | 2010-06-09 | Paper |
| Timetabling problems at the TU Eindhoven | 2009-12-07 | Paper |
| Process Discovery using Integer Linear Programming | 2009-11-30 | Paper |
| Incorporating the strength of MIP modeling in schedule construction | 2009-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396599 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396609 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396641 | 2009-09-19 | Paper |
| Optimal packet-to-slot assignment in mobile telecommunications | 2009-08-14 | Paper |
| Algorithms for Radio Link Frequency Assignment: The Calma Project | 2009-07-03 | Paper |
| The hardness of train rearrangements | 2009-05-07 | Paper |
| How to detect a counterfeit coin: Adaptive versus non-adaptive solutions | 2009-03-23 | Paper |
| The Alcuin Number of a Graph | 2008-11-25 | Paper |
| Prefix Reversals on Binary and Ternary Strings | 2008-08-13 | Paper |
| Process Discovery Using Integer Linear Programming | 2008-07-03 | Paper |
| Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks | 2008-05-22 | Paper |
| Prefix Reversals on Binary and Ternary Strings | 2007-11-29 | Paper |
| Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks | 2007-08-30 | Paper |
| Timetabling problems at the TU Eindhoven | 2007-05-29 | Paper |
| Linear programming models with planned lead times for supply chain operations planning | 2005-02-09 | Paper |
| On the nearest neighbor rule for the traveling salesman problem | 2004-07-01 | Paper |
| Approximation algorithms for the test cover problem | 2004-03-11 | Paper |
| Local search for multiprocessor scheduling: how many moves does it take to a local optimum? | 2003-11-17 | Paper |
| Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances | 2003-10-28 | Paper |
| Whizzkids: Two exercises in computational discrete optimization | 2003-07-15 | Paper |
| Solving a system of linear Diophantine equations with lower and upper bounds on the variables. | 2001-11-26 | Paper |
| Local search algorithms for the radio link frequency assignment problem | 2000-01-01 | Paper |
| Time-Indexed Formulations for Machine Scheduling Problems: Column Generation | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263698 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840362 | 1998-08-10 | Paper |
| Short Shop Schedules | 1998-07-06 | Paper |
| Fast movement strategies for a step‐and‐scan wafer stepper | 1997-11-25 | Paper |
| A branch-and-price algorithm for solving the cutting strips problem | 1997-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3127425 | 1997-04-09 | Paper |
| Approximation Algorithms for the k-Clique Covering Problem | 1997-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027160 | 1993-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3977426 | 1992-06-25 | Paper |
| On the diameter of the edge cover polytope | 1991-01-01 | Paper |
| Blowing up convex sets in the plane | 1990-01-01 | Paper |
| On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems | 1989-01-01 | Paper |
| On fractional multicommodity flows and distance functions | 1989-01-01 | Paper |
| On the existence of an integral potential in a weighted bidirected graph | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3211341 | 1988-01-01 | Paper |
| Conference matrices from projective planes of order 9 | 1985-01-01 | Paper |
