Edge-disjoint homotopic paths in a planar graph with one hole. - C. P. M. van Hoesel; Alexander Schrijver (J. Comb. Theory B, 1990)

Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case. - Albert P. M. Wagelmans; Stan P. M. van Hoesel; Antoon W. J. Kolen (Oper. Res., 1992)

Sensitivity Analysis of the Economic Lot-Sizing Problem. - Stan P. M. van Hoesel; Albert P. M. Wagelmans (Discret. Appl. Math., 1993)

The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming. - Stan P. M. van Hoesel; Roelof Kuik; Marc Salomon; Luk N. Van Wassenhove (Discret. Appl. Math., 1994)

Sensitivity Analysis of List Scheduling Heuristics. - Antoon W. J. Kolen; A. H. G. Rinnooy Kan; C. P. M. van Hoesel; Albert P. M. Wagelmans (Discret. Appl. Math., 1994)

Book reviews. - G. Vossen; A. Frank; Stan P. M. van Hoesel; A. Bouchet (Math. Methods Oper. Res., 1994)

Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs. - C. P. M. van Hoesel; Albert P. M. Wagelmans; Laurence A. Wolsey (SIAM J. Discret. Math., 1994)

An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds. - C. P. M. van Hoesel; Albert P. M. Wagelmans; M. van Vliet (INFORMS J. Comput., 1996)

Routing Trains Through Railway Stations: Model Formulation and Algorithms. - Peter J. Zwaneveld; Leo G. Kroon; H. Edwin Romeijn; Marc Salomon; Stéphane Dauzère-Pérès; Stan P. M. van Hoesel; Harrie W. Ambergen (Transp. Sci., 1996)

On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs. - C. A. van Eijl; C. P. M. van Hoesel (Oper. Res. Lett., 1997)

The partial constraint satisfaction problem: Facets and lifting theorems. - Arie M. C. A. Koster; Stan P. M. van Hoesel; Antoon W. J. Kolen (Oper. Res. Lett., 1998)

Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. - Arie M. C. A. Koster; Stan P. M. van Hoesel; Antoon W. J. Kolen (WG, 1999)

On the Complexity of Postoptimality Analysis of 0/1 Programs. - Stan P. M. van Hoesel; Albert P. M. Wagelmans (Discret. Appl. Math., 1999)

Solving Frequency Assignment Problems via Tree-Decomposition1. - Arie M. C. A. Koster; Stan P. M. van Hoesel; Antoon W. J. Kolen (Electron. Notes Discret. Math., 1999)

A polyhedral approach to single-machine scheduling problems. - J. M. van den Akker; C. P. M. van Hoesel; Martin W. P. Savelsbergh (Math. Program., 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)

Treewidth: Computational Experiments. - Arie M. C. A. Koster; Hans L. Bodlaender; Stan P. M. van Hoesel (Electron. Notes Discret. Math., 2001)

Routing trains through a railway station based on a node packing model. - Peter J. Zwaneveld; Leo G. Kroon; Stan P. M. van Hoesel (Eur. J. Oper. Res., 2001)

Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems. - C. P. M. van Hoesel; Albert P. M. Wagelmans (Math. Oper. Res., 2001)

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)

Solving partial constraint satisfaction problems with tree decomposition. - Arie M. C. A. Koster; Stan P. M. van Hoesel; Antoon W. J. Kolen (Networks, 2002)

Models and solution techniques for frequency assignment problems. - Karen I. Aardal; Stan P. M. van Hoesel; Arie M. C. A. Koster; Carlo Mannino; Antonio Sassano (4OR, 2003)

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)

Pricing Network Edges to Cross a River. - Alexander Grigoriev; Stan P. M. van Hoesel; Anton F. van der Kraaij; Marc Uetz; Mustapha Bouhtou (WAOA, 2004)

A Branch-and-Cut Approach for Solving Railway Line-Planning Problems. - Jan-Willem Goossens; Stan P. M. van Hoesel; Leo G. Kroon (Transp. Sci., 2004)

Integrated Lot Sizing in Serial Supply Chains with Production Capacities. - Stan P. M. van Hoesel; H. Edwin Romeijn; Dolores Romero Morales; Albert P. M. Wagelmans (Manag. Sci., 2005)

Optimization Issues in Combinatorial Auctions. - Stan P. M. van Hoesel; Rudolf Müller (Handbook of Optimization in Telecommunications, 2006)

On solving multi-type railway line planning problems. - Jan-Willem Goossens; Stan P. M. van Hoesel; Leo G. Kroon (Eur. J. Oper. Res., 2006)

Tariff Optimization in Networks. - Mustapha Bouhtou; Stan P. M. van Hoesel; Anton F. van der Kraaij; Jean-Luc Lutton (INFORMS J. Comput., 2007)

An overview of Stackelberg pricing in networks. - Stan P. M. van Hoesel (Eur. J. Oper. Res., 2008)

Finding good tree decompositions by local search. - Stan P. M. van Hoesel; Bert Marchal (Electron. Notes Discret. Math., 2009)

A column generation based algorithm for the robust graph coloring problem. - Birol Yüceoglu; Güvenç Sahin; Stan P. M. van Hoesel (Discret. Appl. Math., 2017)

Safe dike heights at minimal costs: An integer programming approach. - Peter J. Zwaneveld; Gerard Verweij; Stan P. M. van Hoesel (Eur. J. Oper. Res., 2018)