| Publication | Date of Publication | Type |
|---|
| Safe dike heights at minimal costs: an integer programming approach | 2018-05-31 | Paper |
| A column generation based algorithm for the robust graph coloring problem | 2017-03-15 | Paper |
| Treewidth: computational experiments | 2016-07-01 | Paper |
| Finding good tree decompositions by local search | 2013-07-04 | Paper |
| Tariff optimization in networks | 2012-06-18 | Paper |
| Integrated Lot Sizing in Serial Supply Chains with Production Capacities | 2012-02-21 | Paper |
| An overview of Stackelberg pricing in networks | 2008-04-24 | Paper |
| Models and solution techniques for frequency assignment problems | 2008-03-31 | Paper |
| Pricing bridges to cross a river | 2008-01-18 | Paper |
| On the p‐coverage problem on the real line | 2007-10-26 | Paper |
| Optimization issues in combinatorial auctions | 2007-07-23 | Paper |
| Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems | 2005-11-11 | Paper |
| On solving multi-type railway line planning problems | 2005-10-17 | Paper |
| Optimization in telecommunication networks | 2005-09-01 | Paper |
| Models and solution techniques for frequency assignment problems | 2004-02-19 | Paper |
| Bidirected and unidirected capacity installation in telecommunication networks. | 2004-01-05 | Paper |
| Solving partial constraint satisfaction problems with tree decomposition | 2002-12-17 | Paper |
| Routing trains through a railway station based on a node packing model | 2002-04-11 | Paper |
| Polyhedral results for the edge capacity polytope. | 2002-01-01 | Paper |
| Solving frequency assignment problems via tree-decomposition | 2001-09-23 | Paper |
| A polyhedral approach to single-machine scheduling problems. | 2000-11-12 | Paper |
| Polyhedral techniques in combinatorial optimization II: applications and computations | 2000-04-25 | Paper |
| On the complexity of postoptimality analysis of \(0/1\) programs | 1999-08-05 | Paper |
| Lifting valid inequalities for the precedence constrained knapsack problem | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343700 | 1998-02-05 | Paper |
| On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs | 1998-01-15 | Paper |
| An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds | 1998-01-14 | Paper |
| The partial constraint satisfaction problem: Facets and lifting theorems | 1998-01-01 | Paper |
| Routing Trains Through Railway Stations: Model Formulation and Algorithms | 1997-12-14 | Paper |
| An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities | 1996-11-25 | Paper |
| Polyhedral techniques in combinatorial optimization I: Theory | 1996-11-18 | Paper |
| Sensitivity analysis of list scheduling heuristics | 1995-10-10 | Paper |
| Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions | 1995-02-19 | Paper |
| A linear description of the discrete lot-sizing and scheduling problem | 1994-08-21 | Paper |
| Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs | 1994-05-12 | Paper |
| The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming | 1994-03-24 | Paper |
| Sensitivity analysis of the economic lot-sizing problem | 1994-01-09 | Paper |
| Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case | 1992-06-28 | Paper |
| A dual algorithm for the economic lot-sizing problem | 1992-06-25 | Paper |
| A note on Stability of the constant cost dynamic lot size model by K. Richter | 1991-01-01 | Paper |
| Edge-disjoint homotopic paths in a planar graph with one hole | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202818 | 1990-01-01 | Paper |
