| Publication | Date of Publication | Type |
|---|
Safe dike heights at minimal costs: an integer programming approach
European Journal of Operational Research | 2018-05-31 | Paper |
A column generation based algorithm for the robust graph coloring problem
Discrete Applied Mathematics | 2017-03-15 | Paper |
| Treewidth: computational experiments | 2016-07-01 | Paper |
Finding good tree decompositions by local search
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Tariff optimization in networks
INFORMS Journal on Computing | 2012-06-18 | Paper |
Integrated lot sizing in serial supply chains with production capacities
Management Science | 2012-02-21 | Paper |
An overview of Stackelberg pricing in networks
European Journal of Operational Research | 2008-04-24 | Paper |
Models and solution techniques for frequency assignment problems
Annals of Operations Research | 2008-03-31 | Paper |
Pricing bridges to cross a river
Naval Research Logistics | 2008-01-18 | Paper |
On the p‐coverage problem on the real line
Statistica Neerlandica | 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
Mathematics of Operations Research | 2005-11-11 | Paper |
On solving multi-type railway line planning problems
European Journal of Operational Research | 2005-10-17 | Paper |
Optimization in telecommunication networks
Statistica Neerlandica | 2005-09-01 | Paper |
Models and solution techniques for frequency assignment problems
4OR | 2004-02-19 | Paper |
Bidirected and unidirected capacity installation in telecommunication networks.
Discrete Applied Mathematics | 2004-01-05 | Paper |
Solving partial constraint satisfaction problems with tree decomposition
Networks | 2002-12-17 | Paper |
Routing trains through a railway station based on a node packing model
European Journal of Operational Research | 2002-04-11 | Paper |
Polyhedral results for the edge capacity polytope.
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
| Solving frequency assignment problems via tree-decomposition | 2001-09-23 | Paper |
A polyhedral approach to single-machine scheduling problems.
Mathematical Programming. Series A. Series B | 2000-11-12 | Paper |
Polyhedral techniques in combinatorial optimization II: applications and computations
Statistica Neerlandica | 2000-04-25 | Paper |
On the complexity of postoptimality analysis of \(0/1\) programs
Discrete Applied Mathematics | 1999-08-05 | Paper |
Lifting valid inequalities for the precedence constrained knapsack problem
Mathematical Programming. Series A. Series B | 1999-01-01 | Paper |
| scientific article; zbMATH DE number 1031377 (Why is no real title available?) | 1998-02-05 | Paper |
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
Operations Research Letters | 1998-01-15 | Paper |
An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds
INFORMS Journal on Computing | 1998-01-14 | Paper |
The partial constraint satisfaction problem: Facets and lifting theorems
Operations Research Letters | 1998-01-01 | Paper |
Routing Trains Through Railway Stations: Model Formulation and Algorithms
Transportation Science | 1997-12-14 | Paper |
An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
Management Science | 1996-11-25 | Paper |
Polyhedral techniques in combinatorial optimization I: Theory
Statistica Neerlandica | 1996-11-18 | Paper |
Sensitivity analysis of list scheduling heuristics
Discrete Applied Mathematics | 1995-10-10 | Paper |
Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
European Journal of Operational Research | 1995-02-19 | Paper |
A linear description of the discrete lot-sizing and scheduling problem
European Journal of Operational Research | 1994-08-21 | Paper |
Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
SIAM Journal on Discrete Mathematics | 1994-05-12 | Paper |
The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
Discrete Applied Mathematics | 1994-03-24 | Paper |
Sensitivity analysis of the economic lot-sizing problem
Discrete Applied Mathematics | 1994-01-09 | Paper |
Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
Operations Research | 1992-06-28 | Paper |
A dual algorithm for the economic lot-sizing problem
European Journal of Operational Research | 1992-06-25 | Paper |
A note on Stability of the constant cost dynamic lot size model by K. Richter
European Journal of Operational Research | 1991-01-01 | Paper |
Edge-disjoint homotopic paths in a planar graph with one hole
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4197717 (Why is no real title available?) | 1990-01-01 | Paper |
