Stan P. M. van Hoesel

C. P. M. van Hoesel

University of Maastricht, The Netherlands

	2009
26		Stan P. M. van Hoesel, Bert Marchal: Finding good tree decompositions by local search. Electronic Notes in Discrete Mathematics 32: 43-50 (2009)
	2008
25		Stan P. M. van Hoesel: An overview of Stackelberg pricing in networks. European Journal of Operational Research 189(3): 1393-1402 (2008)
	2007
24		Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano: Models and solution techniques for frequency assignment problems. Annals OR 153(1): 79-129 (2007)
23		Mustapha Bouhtou, Stan P. M. van Hoesel, Anton F. van der Kraaij, Jean-Luc Lutton: Tariff Optimization in Networks. INFORMS Journal on Computing 19(3): 458-469 (2007)
	2006
22		Jan-Willem Goossens, Stan P. M. van Hoesel, Leo G. Kroon: On solving multi-type railway line planning problems. European Journal of Operational Research 168(2): 403-424 (2006)
	2005
21		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. Management Science 51(11): 1706-1719 (2005)
	2004
20		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: 140-153
19		Jan-Willem Goossens, Stan P. M. van Hoesel, Leo G. Kroon: A Branch-and-Cut Approach for Solving Railway Line-Planning Problems. Transportation Science 38(3): 379-393 (2004)
	2003
18		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): 261-317 (2003)
17		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. Discrete Applied Mathematics 133(1-3): 103-121 (2003)
	2002
16		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): 335-358 (2002)
15		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): 170-180 (2002)
	2001
14		Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel: Treewidth: Computational Experiments. Electronic Notes in Discrete Mathematics 8: 54-57 (2001)
13		Peter J. Zwaneveld, Leo G. Kroon, Stan P. M. van Hoesel: Routing trains through a railway station based on a node packing model. European Journal of Operational Research 128(1): 14-33 (2001)
12		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): 339-357 (2001)
	1999
11		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: 338-349
10		Stan P. M. van Hoesel, Albert P. M. Wagelmans: On the Complexity of Postoptimality Analysis of 0/1 Programs. Discrete Applied Mathematics 91(1-3): 251-263 (1999)
9		Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen: Solving Frequency Assignment Problems via Tree-Decomposition1. Electronic Notes in Discrete Mathematics 3: 102-105 (1999)
	1998
8		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): 89-97 (1998)
	1996
7		C. P. M. van Hoesel, Albert P. M. Wagelmans, M. van Vliet: An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds. INFORMS Journal on Computing 8(4): 376-382 (1996)
6		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. Transportation Science 30(3): 181-194 (1996)
	1994
5		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. Discrete Applied Mathematics 48(3): 289-303 (1994)
4		Antoon W. J. Kolen, A. H. G. Rinnooy Kan, C. P. M. van Hoesel, Albert P. M. Wagelmans: Sensitivity Analysis of List Scheduling Heuristics. Discrete Applied Mathematics 55(2): 145-162 (1994)
3		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. Discrete Math. 7(1): 141-151 (1994)
	1993
2		Stan P. M. van Hoesel, Albert P. M. Wagelmans: Sensitivity Analysis of the Economic Lot-Sizing Problem. Discrete Applied Mathematics 45(3): 291-312 (1993)
	1990
1		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): 77-91 (1990)

Coauthor Index

1	Karen Aardal	[18] [24]
2	Harrie W. Ambergen	[6]
3	Hans L. Bodlaender	[14]
4	Mustapha Bouhtou	[20] [23]
5	Stéphane Dauzère-Pérès	[6]
6	Jan-Willem Goossens	[19] [22]
7	Alexander Grigoriev	[20]
8	Alexander H. G. Rinnooy Kan (A. H. G. Rinnooy Kan)	[4]
9	Antoon W. J. Kolen	[4] [8] [9] [11] [15]
10	Arie M. C. A. Koster	[8] [9] [11] [14] [15] [16] [17] [18] [24]
11	Anton F. van der Kraaij	[20] [23]
12	Leo G. Kroon	[6] [13] [19] [22]
13	Roelof Kuik	[5]
14	Robert L. M. J. van de Leensel	[16] [17]
15	Jean-Luc Lutton	[23]
16	Carlo Mannino	[18] [24]
17	Bert Marchal	[26]
18	Dolores Romero Morales	[21]
19	H. Edwin Romeijn	[6] [21]
20	Marc Salomon	[5] [6]
21	Antonio Sassano	[18] [24]
22	Martin W. P. Savelsbergh	[16] [17]
23	Alexander Schrijver	[1]
24	Marc Uetz	[20]
25	M. van Vliet	[7]
26	Albert P. M. Wagelmans	[2] [3] [4] [7] [10] [12] [21]
27	Luk N. Van Wassenhove	[5]
28	Laurence A. Wolsey	[3]
29	Peter J. Zwaneveld	[6] [13]

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page