Stan P. M. van Hoesel

Publication Activity (10 Years)

Years Active: 1992-2018
Publications (10 Years): 2

Top Topics

Dantzig Wolfe Decomposition

Integer Program

Column Generation

Lagrangian Relaxation

Top Venues

Discret. Appl. Math.

Eur. J. Oper. Res.

Publications

Peter J. Zwaneveld, Gerard Verweij, Stan P. M. van Hoesel
Safe dike heights at minimal costs: An integer programming approach. Eur. J. Oper. Res. 270 (1) (2018)
Birol Yüceoglu, Güvenç Sahin, Stan P. M. van Hoesel
A column generation based algorithm for the robust graph coloring problem. Discret. Appl. Math. 217 (2017)
Stan P. M. van Hoesel, Bert Marchal
Finding good tree decompositions by local search. Electron. Notes Discret. Math. 32 (2009)
Stan P. M. van Hoesel
An overview of Stackelberg pricing in networks. Eur. J. Oper. Res. 189 (3) (2008)
Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano
Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153 (1) (2007)
Mustapha Bouhtou, Stan P. M. van Hoesel, Anton F. van der Kraaij, Jean-Luc Lutton
Tariff Optimization in Networks. INFORMS J. Comput. 19 (3) (2007)
Jan-Willem Goossens, Stan P. M. van Hoesel, Leo G. Kroon
On solving multi-type railway line planning problems. Eur. J. Oper. Res. 168 (2) (2006)
Stan P. M. van Hoesel, H. Edwin Romeijn, Dolores Romero Morales, Albert P. M. Wagelmans
Integrated Lot Sizing in Serial Supply Chains with Production Capacities. Manag. Sci. 51 (11) (2005)
Alexander Grigoriev, Stan P. M. van Hoesel, Anton F. van der Kraaij, Marc Uetz, Mustapha Bouhtou
Pricing Network Edges to Cross a River. WAOA (2004)
Jan-Willem Goossens, Stan P. M. van Hoesel, Leo G. Kroon
A Branch-and-Cut Approach for Solving Railway Line-Planning Problems. Transp. Sci. 38 (3) (2004)
Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano
Models and solution techniques for frequency assignment problems. 4OR 1 (4) (2003)
Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh
Bidirected and unidirected capacity installation in telecommunication networks. Discret. Appl. Math. 133 (1-3) (2003)
Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh
Polyhedral results for the edge capacity polytope. Math. Program. 92 (2) (2002)
Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
Solving partial constraint satisfaction problems with tree decomposition. Networks 40 (3) (2002)
Peter J. Zwaneveld, Leo G. Kroon, Stan P. M. van Hoesel
Routing trains through a railway station based on a node packing model. Eur. J. Oper. Res. 128 (1) (2001)
Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel
Treewidth: Computational Experiments. Electron. Notes Discret. Math. 8 (2001)
Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
. Electron. Notes Discret. Math. 3 (1999)
Stan P. M. van Hoesel, Albert P. M. Wagelmans
On the Complexity of Postoptimality Analysis of 0/1 Programs. Discret. Appl. Math. 91 (1-3) (1999)
Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. WG (1999)
Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
The partial constraint satisfaction problem: Facets and lifting theorems. Oper. Res. Lett. 23 (3-5) (1998)
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
Routing Trains Through Railway Stations: Model Formulation and Algorithms. Transp. Sci. 30 (3) (1996)
Stan P. M. van Hoesel, Roelof Kuik, Marc Salomon, Luk N. Van Wassenhove
The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming. Discret. Appl. Math. 48 (3) (1994)
G. Vossen, A. Frank, Stan P. M. van Hoesel, A. Bouchet
Book reviews. Math. Methods Oper. Res. 39 (3) (1994)
Stan P. M. van Hoesel, Albert P. M. Wagelmans
Sensitivity Analysis of the Economic Lot-Sizing Problem. Discret. Appl. Math. 45 (3) (1993)
Albert P. M. Wagelmans, Stan P. M. van Hoesel, Antoon W. J. Kolen
Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case. Oper. Res. 40 (Supplement-1) (1992)