default search action
Stan P. M. van Hoesel
Person information
- affiliation: University of Maastricht, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j31]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): 294-301 (2018) - 2017
- [j30]Birol Yüceoglu
, Güvenç Sahin
A column generation based algorithm for the robust graph coloring problem. Discret. Appl. Math. 217: 340-352 (2017)
2000 – 2009
- 2009
- [j29]Stan P. M. van Hoesel, Bert Marchal:
Finding good tree decompositions by local search. Electron. Notes Discret. Math. 32: 43-50 (2009) - 2008
- [j28]Stan P. M. van Hoesel:
An overview of Stackelberg pricing in networks. Eur. J. Oper. Res. 189(3): 1393-1402 (2008) - 2007
- [j27]Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster
Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153(1): 79-129 (2007) - [j26]Mustapha Bouhtou, Stan P. M. van Hoesel, Anton F. van der Kraaij, Jean-Luc Lutton:
Tariff Optimization in Networks. INFORMS J. Comput. 19(3): 458-469 (2007) - 2006
- [j25]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): 403-424 (2006) - [p1]Stan P. M. van Hoesel, Rudolf Müller:
Optimization Issues in Combinatorial Auctions. Handbook of Optimization in Telecommunications 2006: 1051-1071 - 2005
- [j24]Stan P. M. van Hoesel, H. Edwin Romeijn, Dolores Romero Morales
Integrated Lot Sizing in Serial Supply Chains with Production Capacities. Manag. Sci. 51(11): 1706-1719 (2005) - 2004
- [j23]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): 379-393 (2004) - [c2]Alexander Grigoriev
Pricing Network Edges to Cross a River. WAOA 2004: 140-153 - 2003
- [j22]Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster
Models and solution techniques for frequency assignment problems. 4OR 1(4): 261-317 (2003) - [j21]Stan P. M. van Hoesel, Arie M. C. A. Koster
Bidirected and unidirected capacity installation in telecommunication networks. Discret. Appl. Math. 133(1-3): 103-121 (2003) - 2002
- [j20]Stan P. M. van Hoesel, Arie M. C. A. Koster
Polyhedral results for the edge capacity polytope. Math. Program. 92(2): 335-358 (2002) - [j19]Arie M. C. A. Koster
Solving partial constraint satisfaction problems with tree decomposition. Networks 40(3): 170-180 (2002) - 2001
- [j18]Arie M. C. A. Koster
Treewidth: Computational Experiments. Electron. Notes Discret. Math. 8: 54-57 (2001) - [j17]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): 14-33 (2001) - [j16]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)
1990 – 1999
- 1999
- [j15]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): 251-263 (1999) - [j14]Arie M. C. A. Koster
Solving Frequency Assignment Problems via Tree-Decomposition1. Electron. Notes Discret. Math. 3: 102-105 (1999) - [j13]J. M. van den Akker, C. P. M. van Hoesel, Martin W. P. Savelsbergh:
A polyhedral approach to single-machine scheduling problems. Math. Program. 85(3): 541-572 (1999) - [j12]Robert L. M. J. van de Leensel, C. P. M. van Hoesel, Joris van de Klundert
Lifting valid inequalities for the precedence constrained knapsack problem. Math. Program. 86(1): 161-185 (1999) - [c1]Arie M. C. A. Koster
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. WG 1999: 338-349 - 1998
- [j11]Arie M. C. A. Koster
The partial constraint satisfaction problem: Facets and lifting theorems. Oper. Res. Lett. 23(3-5): 89-97 (1998) - 1997
- [j10]C. A. van Eijl, C. P. M. van Hoesel:
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs. Oper. Res. Lett. 20(1): 7-13 (1997) - 1996
- [j9]C. P. M. van Hoesel, Albert P. M. Wagelmans
An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds. INFORMS J. Comput. 8(4): 376-382 (1996) - [j8]Peter J. Zwaneveld, Leo G. Kroon, H. Edwin Romeijn, Marc Salomon, Stéphane Dauzère-Pérès
Routing Trains Through Railway Stations: Model Formulation and Algorithms. Transp. Sci. 30(3): 181-194 (1996) - 1994
- [j7]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): 289-303 (1994) - [j6]Antoon W. J. Kolen, A. H. G. Rinnooy Kan, C. P. M. van Hoesel, Albert P. M. Wagelmans
Sensitivity Analysis of List Scheduling Heuristics. Discret. Appl. Math. 55(2): 145-162 (1994) - [j5]G. Vossen, A. Frank, Stan P. M. van Hoesel, A. Bouchet:
Book reviews. Math. Methods Oper. Res. 39(3): 376-383 (1994) - [j4]C. P. M. van Hoesel, Albert P. M. Wagelmans
Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs. SIAM J. Discret. Math. 7(1): 141-151 (1994) - 1993
- [j3]Stan P. M. van Hoesel, Albert P. M. Wagelmans
Sensitivity Analysis of the Economic Lot-Sizing Problem. Discret. Appl. Math. 45(3): 291-312 (1993) - 1992
- [j2]Albert P. M. Wagelmans
Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case. Oper. Res. 40(Supplement-1): S145-S156 (1992) - 1990
- [j1]C. P. M. van Hoesel, Alexander Schrijver:
Edge-disjoint homotopic paths in a planar graph with one hole. J. Comb. Theory B 48(1): 77-91 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: