Stan P. M. van Hoesel

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