C. P. M. van Hoesel

Publication Activity (10 Years)

Years Active: 1990-2001
Publications (10 Years): 0

Publications

C. P. M. van Hoesel, Albert P. M. Wagelmans
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems. Math. Oper. Res. 26 (2) (2001)
Robert L. M. J. van de Leensel, C. P. M. van Hoesel, Joris van de Klundert
Lifting valid inequalities for the precedence constrained knapsack problem. Math. Program. 86 (1) (1999)
J. M. van den Akker, C. P. M. van Hoesel, Martin W. P. Savelsbergh
A polyhedral approach to single-machine scheduling problems. Math. Program. 85 (3) (1999)
C. A. van Eijl, C. P. M. van Hoesel
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs. Oper. Res. Lett. 20 (1) (1997)
C. P. M. van Hoesel, Albert P. M. Wagelmans, M. van Vliet
) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds. INFORMS J. Comput. 8 (4) (1996)
Antoon W. J. Kolen, A. H. G. Rinnooy Kan, C. P. M. van Hoesel, Albert P. M. Wagelmans
Sensitivity Analysis of List Scheduling Heuristics. Discret. Appl. Math. 55 (2) (1994)
C. P. M. van Hoesel, Albert P. M. Wagelmans, Laurence A. Wolsey
Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs. SIAM J. Discret. Math. 7 (1) (1994)
C. P. M. van Hoesel, Alexander Schrijver
Edge-disjoint homotopic paths in a planar graph with one hole. J. Comb. Theory, Ser. B 48 (1) (1990)