Cost allocation in the Chinese postman problem. - Herbert Hamers; Peter Borm; Robert L. M. J. van de Leensel; Stef Tijs (Eur. J. Oper. Res., 1999)

Lifting valid inequalities for the precedence constrained knapsack problem. - Robert L. M. J. van de Leensel; C. P. M. van Hoesel; Joris van de Klundert (Math. Program., 1999)

A dynamic programming algorithm for the local access telecommunication network expansion problem. - Olaf E. Flippo; Antoon W. J. Kolen; Arie M. C. A. Koster; Robert L. M. J. van de Leensel (Eur. J. Oper. Res., 2000)

Polyhedral results for the edge capacity polytope. - Stan P. M. van Hoesel; Arie M. C. A. Koster; Robert L. M. J. van de Leensel; Martin W. P. Savelsbergh (Math. Program., 2002)

Bidirected and unidirected capacity installation in telecommunication networks. - Stan P. M. van Hoesel; Arie M. C. A. Koster; Robert L. M. J. van de Leensel; Martin W. P. Savelsbergh (Discret. Appl. Math., 2003)