default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWim Vancroonenburg
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Emmanouil Thanos, Túlio A. M. Toffolo
, Haroldo Gambini Santos, Wim Vancroonenburg, Greet Vanden Berghe:
The tactical berth allocation problem with time-variant specific quay crane assignments. Comput. Ind. Eng. 155: 107168 (2021)- [j13]Everton Fernandes da Silva, Hatice Çalik, Wim Vancroonenburg, Aline Aparecida de Souza Leão, Tony Wauters:
Extracting maximal objects from three-dimensional solid materials. Comput. Oper. Res. 132: 105290 (2021) - 2020
- [j12]Farzaneh Karami, Wim Vancroonenburg, Greet Vanden Berghe:
A periodic optimization approach to dynamic pickup and delivery problems with time windows. J. Sched. 23(6): 711-731 (2020)
2010 – 2019
- 2019
- [j11]Anders Reenberg Andersen, Wim Vancroonenburg, Greet Vanden Berghe:
Strategic room type allocation for nursing wards through Markov chain modeling. Artif. Intell. Medicine 99 (2019) - [j10]Sam Heshmati, Túlio A. M. Toffolo, Wim Vancroonenburg, Greet Vanden Berghe:
Crane-operated warehouses: Integrating location assignment and crane scheduling. Comput. Ind. Eng. 129: 274-295 (2019) - [j9]Yi-Hang Zhu, Túlio A. M. Toffolo, Wim Vancroonenburg, Greet Vanden Berghe:
Compatibility of short and long term objectives for dynamic patient admission scheduling. Comput. Oper. Res. 104: 98-112 (2019) - 2017
- [c1]Pieter Bonte, Femke Ongenae, Jeroen Schaballie, Wim Vancroonenburg, Bert Vankeirsbilck, Filip De Turck:
Context-Aware and Self-learning Dynamic Transport Scheduling in Hospitals. ESWC (Satellite Events) 2017: 167-171 - [i1]Fabio Salassa, Wim Vancroonenburg, Tony Wauters, Federico Della Croce, Greet Vanden Berghe:
MILP and Max-Clique based heuristics for the Eternity II puzzle. CoRR abs/1709.00252 (2017) - 2016
- [j8]Wim Vancroonenburg, Patrick De Causmaecker, Greet Vanden Berghe:
A study of decision support models for online patient-to-room assignment planning. Ann. Oper. Res. 239(1): 253-271 (2016) - [j7]Michele Garraffa, Fabio Salassa, Wim Vancroonenburg, Greet Vanden Berghe, Tony Wauters:
The one-dimensional cutting stock problem with sequence-dependent cut losses. Int. Trans. Oper. Res. 23(1-2): 5-24 (2016) - [j6]Andrea Grosso, Fabio Salassa, Wim Vancroonenburg:
Searching for a cycle with maximum coverage in undirected graphs. Optim. Lett. 10(7): 1493-1504 (2016) - [j5]Tony Wauters, Joris Kinable, Pieter Smet, Wim Vancroonenburg, Greet Vanden Berghe, Jannes Verstichel:
The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem - The MISTA 2013 challenge. J. Sched. 19(3): 271-283 (2016) - 2015
- [b1]Wim Vancroonenburg:
Operational Decision Support Models and Algorithms for Hospital Admission Planning and Scheduling ; Operationele beslissingsondersteunende modellen en algoritmen voor opnameplanning in ziekenhuizen. Katholieke Universiteit Leuven, Belgium, 2015 - 2014
- [j4]Wim Vancroonenburg, Federico Della Croce, Dries R. Goossens, Frits C. R. Spieksma:
The Red-Blue transportation problem. Eur. J. Oper. Res. 237(3): 814-823 (2014) - 2013
- [j3]Tony Wauters, Wim Vancroonenburg, Greet Vanden Berghe:
A Guide-and-Observe Hyper-Heuristic Approach to the Eternity II Puzzle. J. Math. Model. Algorithms 12(1): 27-43 (2013) - 2012
- [j2]Burak Bilgin, Peter Demeester, Mustafa Misir, Wim Vancroonenburg, Greet Vanden Berghe:
One hyper-heuristic approach to two timetabling problems in health care. J. Heuristics 18(3): 401-434 (2012) - [j1]Tony Wauters, Wim Vancroonenburg, Greet Vanden Berghe:
A Guide-and-Observe Hyper-Heuristic Approach to the Eternity II Puzzle. J. Math. Model. Algorithms 11(3): 217-233 (2012)
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-04-25 05:49 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:
