default search action
Greet Vanden Berghe
Person information
- affiliation: Catholic University of Leuven, Department of Computer Science, Belgium
- not to be confused with: Greet Van den Berghe
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j90]Emmanouil Thanos
, Luke Connolly, Greet Vanden Berghe
Coarse-grained vs fine-grained optimisation in highly integrated problem environments: A case study featuring port terminal operations. Comput. Ind. Eng. 188: 109933 (2024) - [j89]Hatice Çalik
The exam location problem: Mathematical formulations and variants. Comput. Oper. Res. 161: 106438 (2024) - [j88]Bryan Coulier
The constrained Bottleneck Spanning Tree Problem with upgrades. Discret. Appl. Math. 353: 12-28 (2024) - [j87]Fotios Petropoulos
Operational Research: methods and applications. J. Oper. Res. Soc. 75(3): 423-617 (2024) - [i4]Martina Doneda, Pieter Smet, Giuliana Carello, Ettore Lanzarone, Greet Vanden Berghe:
Robust personnel rostering: how accurate should absenteeism predictions be? CoRR abs/2406.18119 (2024) - 2023
- [j86]Hatice Çalik
Cargo securing under multi-drop and axle weight constraints. Eur. J. Oper. Res. 307(1): 157-176 (2023) - [i3]Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe:
Models and algorithms for simple disjunctive temporal problems. CoRR abs/2302.02644 (2023) - 2022
- [j85]Federico Mosquera, Pieter Smet
An Algorithm for Generating a Diverse Set of Multi-Modal Journeys. Algorithms 15(11): 416 (2022) - [j84]Carlo S. Sartori
Truck driver scheduling with interdependent routes and working time constraints. EURO J. Transp. Logist. 11: 100092 (2022) - [j83]Carlo S. Sartori
Scheduling truck drivers with interdependent routes under European Union regulations. Eur. J. Oper. Res. 298(1): 76-88 (2022) - [j82]Vinícius Gandra Martins Santos
The vessel swap-body routing problem. Eur. J. Oper. Res. 303(1): 354-369 (2022) - [j81]Ender Özcan, Patrick De Causmaecker
Advances in the practice and theory of automated timetabling. J. Sched. 25(3): 259 (2022) - 2021
- [j80]Emmanouil Thanos, Túlio A. M. Toffolo
The tactical berth allocation problem with time-variant specific quay crane assignments. Comput. Ind. Eng. 155: 107168 (2021) - [j79]Vinícius Gandra Martins Santos
The impact of loading restrictions on the two-echelon location routing problem. Comput. Ind. Eng. 160: 107609 (2021) - [j78]Elín Björk Böðvarsdóttir
Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds. Eur. J. Oper. Res. 292(3): 980-995 (2021) - [j77]Matheus Guedes Vilas Boas, Haroldo Gambini Santos
Optimal decision trees for the algorithm selection problem: integer programming based approaches. Int. Trans. Oper. Res. 28(5): 2759-2781 (2021) - [j76]Emmanouil Thanos, Tony Wauters
Dispatch and conflict-free routing of capacitated vehicles with storage stack allocation. J. Oper. Res. Soc. 72(8): 1780-1793 (2021) - [j75]Toni Ismael Wickert
Quantifying and enforcing robustness in staff rostering. J. Sched. 24(3): 347-366 (2021) - [c22]Carlo S. Sartori
Efficient Duration-Based Workload Balancing for Interdependent Vehicle Routes. ATMOS 2021: 1:1-1:15 - [c21]Vinícius Gandra
A heuristic approach to feasibility verification for truck loading. GECCO Companion 2021: 1564-1569 - [c20]Michiel Van Lancker
Neighborhood Enumeration in Local Search Metaheuristics. OLA 2021: 229-240 - 2020
- [j74]Thomas Van den Bossche
Truck scheduling in tank terminals. EURO J. Transp. Logist. 9(1): 100001 (2020) - [j73]Jan Christiaens, Hatice Çalik
The prisoner transportation problem. Eur. J. Oper. Res. 284(3): 1058-1073 (2020) - [j72]Komarudin
The extended roster quality staffing problem: addressing roster quality variation within a staffing planning period. J. Sched. 23(2): 253-264 (2020) - [j71]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) - [j70]Jan Christiaens
Slack Induction by String Removals for Vehicle Routing Problems. Transp. Sci. 54(2): 417-433 (2020)
2010 – 2019
- 2019
- [j69]Túlio A. M. Toffolo
The sport teams grouping problem. Ann. Oper. Res. 275(1): 223-243 (2019) - [j68]Anders Reenberg Andersen
Strategic room type allocation for nursing wards through Markov chain modeling. Artif. Intell. Medicine 99 (2019) - [j67]Sam Heshmati
Crane-operated warehouses: Integrating location assignment and crane scheduling. Comput. Ind. Eng. 129: 274-295 (2019) - [j66]Yi-Hang Zhu
Compatibility of short and long term objectives for dynamic patient admission scheduling. Comput. Oper. Res. 104: 98-112 (2019) - [j65]Toni Ismael Wickert, Pieter Smet
The nurse rerostering problem: Strategies for reconstructing disrupted schedules. Comput. Oper. Res. 104: 319-337 (2019) - [j64]Sam Heshmati
Alternative e-commerce delivery policies. EURO J. Transp. Logist. 8(3): 217-248 (2019) - [j63]Juan Francisco Correcher
The berth allocation problem in terminals with irregular layouts. Eur. J. Oper. Res. 272(3): 1096-1108 (2019) - [j62]Haroldo G. Santos
Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem. Int. Trans. Oper. Res. 26(2): 707-724 (2019) - [i2]Matheus Guedes Vilas Boas, Haroldo Gambini Santos, Luiz Henrique de Campos Merschmann, Greet Vanden Berghe:
Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches. CoRR abs/1907.02211 (2019) - 2018
- [j61]Túlio A. M. Toffolo
Stochastic local search with learning automaton for the swap-body vehicle routing problem. Comput. Oper. Res. 89: 68-81 (2018) - [j60]Zdenek Hanzálek
Preface. J. Sched. 21(2): 129-130 (2018) - 2017
- [j59]Yves Molenbruch
Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation. Comput. Oper. Res. 77: 58-71 (2017) - [j58]David Van Den Dooren, Thomas Sys, Túlio A. M. Toffolo
Multi-machine energy-aware scheduling. EURO J. Comput. Optim. 5(1-2): 285-307 (2017) - [j57]Túlio A. M. Toffolo
A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem. Eur. J. Oper. Res. 257(2): 526-538 (2017) - [j56]Pieter Smet
Local and global constraint consistency in personnel rostering. Int. Trans. Oper. Res. 24(5): 1099-1117 (2017) - [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
- [j55]Wim Vancroonenburg, Patrick De Causmaecker
A study of decision support models for online patient-to-room assignment planning. Ann. Oper. Res. 239(1): 253-271 (2016) - [j54]Tony Wauters
A decomposition approach to dual shuttle automated storage and retrieval systems. Comput. Ind. Eng. 101: 325-337 (2016) - [j53]Pieter Smet
Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem. Comput. Oper. Res. 76: 60-72 (2016) - [j52]Pieter Smet
Polynomially solvable personnel rostering problems. Eur. J. Oper. Res. 249(1): 67-75 (2016) - [j51]Túlio A. M. Toffolo
Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem. Eur. J. Oper. Res. 250(3): 737-744 (2016) - [j50]Ward Passchyn, Sofie Coene, Dirk Briskorn
The lockmaster's problem. Eur. J. Oper. Res. 251(2): 432-441 (2016) - [j49]Rinde R. S. van Lon
Measures of dynamism and urgency in logistics. Eur. J. Oper. Res. 253(3): 614-624 (2016) - [j48]Michele Garraffa, Fabio Salassa
The one-dimensional cutting stock problem with sequence-dependent cut losses. Int. Trans. Oper. Res. 23(1-2): 5-24 (2016) - [j47]Graham Kendall, Ruibin Bai
Good Laboratory Practice for optimization research. J. Oper. Res. Soc. 67(4): 676-689 (2016) - [j46]Graham Kendall, Greet Vanden Berghe, Barry McCollum:
Preface. J. Sched. 19(3): 213 (2016) - [j45]Tony Wauters
The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem - The MISTA 2013 challenge. J. Sched. 19(3): 271-283 (2016) - [c19]Jannes Verstichel, Greet Vanden Berghe:
Simulation and optimization for ship lock scheduling: A case study. IISA 2016: 1-6 - 2015
- [j44]Jannes Verstichel, Joris Kinable
A Combinatorial Benders' decomposition for the lock scheduling problem. Comput. Oper. Res. 54: 117-128 (2015) - [j43]Mustafa Misir
An analysis of generalised heuristics for vehicle routing and personnel rostering problems. J. Oper. Res. Soc. 66(5): 858-870 (2015) - [j42]Komarudin
Balancing attainability, desirability and promotion steadiness in manpower planning systems. J. Oper. Res. Soc. 66(12): 2004-2014 (2015) - [j41]Tony Wauters
A learning-based optimization approach to multi-project scheduling. J. Sched. 18(1): 61-74 (2015) - 2014
- [j40]Pieter Smet
Modelling and evaluation issues in nurse rostering. Ann. Oper. Res. 218(1): 303-326 (2014) - [j39]Joris Kinable
The concrete delivery problem. Comput. Oper. Res. 48: 53-68 (2014) - [j38]Jannes Verstichel, Patrick De Causmaecker
Exact and heuristic methods for placing ships in locks. Eur. J. Oper. Res. 235(2): 387-398 (2014) - [j37]Tony Wauters
Decomposition and local search based methods for the traveling umpire problem. Eur. J. Oper. Res. 238(3): 886-898 (2014) - [j36]Joris Kinable
School bus routing - a column generation approach. Int. Trans. Oper. Res. 21(3): 453-478 (2014) - [c18]Joris Maervoet, Patrick De Causmaecker
Fast approximation of reach hierarchies in networks. SIGSPATIAL/GIS 2014: 441-444 - 2013
- [j35]Mustafa Misir
An investigation on the generality level of selection hyper-heuristics under different empirical conditions. Appl. Soft Comput. 13(7): 3335-3353 (2013) - [j34]Jan Van Belle, Paul Valckenaers, Greet Vanden Berghe, Dirk Cattrysse:
A tabu search approach to the truck scheduling problem with multiple docks and time windows. Comput. Ind. Eng. 66(4): 818-826 (2013) - [j33]Tony Wauters
An effective shaking procedure for 2D and 3D strip packing problems. Comput. Oper. Res. 40(11): 2662-2669 (2013) - [j32]Komarudin
The roster quality staffing problem - A methodology for improving the roster quality by modifying the personnel structure. Eur. J. Oper. Res. 230(3): 551-562 (2013) - [j31]Simon Martin, Djamila Ouelhadj, Pieter Smet
Cooperative search for fair nurse rosters. Expert Syst. Appl. 40(16): 6674-6683 (2013) - [j30]Edmund K. Burke
A Time Predefined Variable Depth Search for Nurse Rostering. INFORMS J. Comput. 25(3): 411-419 (2013) - [j29]Jannes Verstichel, Patrick De Causmaecker
An improved best-fit heuristic for the orthogonal strip packing problem. Int. Trans. Oper. Res. 20(5): 711-730 (2013) - [j28]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) - [j27]Mustafa Misir
A new hyper-heuristic as a general problem solver: an implementation in HyFlex. J. Sched. 16(3): 291-311 (2013) - [j26]Wouter Souffriau, Pieter Vansteenwegen
The Multiconstraint Team Orienteering Problem with Multiple Time Windows. Transp. Sci. 47(1): 53-63 (2013) - [c17]Stefaan Haspeslagh, Tommy Messelis, Greet Vanden Berghe, Patrick De Causmaecker:
An Efficient Translation Scheme for Representing Nurse Rostering Problems as Satisfiability Problems. ICAART (2) 2013: 303-310 - [c16]Joris Maervoet, Pascal Brackman, Katja Verbeeck, Patrick De Causmaecker
Tour Suggestion for Outdoor Activities. W2GIS 2013: 54-63 - [p3]Pieter Smet
Nurse Rostering: A Complex Example of Personnel Scheduling with Perspectives. Automated Scheduling and Planning 2013: 129-153 - [p2]Tony Wauters
Boosting Metaheuristic Search Using Reinforcement Learning. Hybrid Metaheuristics 2013: 433-452 - 2012
- [j25]Burak Bilgin, Patrick De Causmaecker
Local search neighbourhoods for dealing with a novel nurse rostering model. Ann. Oper. Res. 194(1): 33-57 (2012) - [j24]Patrick De Causmaecker
Towards a reference model for timetabling and rostering. Ann. Oper. Res. 194(1): 167-176 (2012) - [j23]Sanja Petrovic, Greet Vanden Berghe:
A comparison of two approaches to nurse rostering problems. Ann. Oper. Res. 194(1): 365-384 (2012) - [j22]Tony Wauters
Real-world production scheduling for the food industry: An integrated approach. Eng. Appl. Artif. Intell. 25(2): 222-228 (2012) - [j21]Joris Maervoet, Celine Vens, Greet Vanden Berghe, Hendrik Blockeel
Outlier detection in relational data: A case study in geographical information systems. Expert Syst. Appl. 39(5): 4718-4728 (2012) - [j20]Burak Bilgin, Peter Demeester, Mustafa Misir
One hyper-heuristic approach to two timetabling problems in health care. J. Heuristics 18(3): 401-434 (2012) - [j19]Tony Wauters
A Guide-and-Observe Hyper-Heuristic Approach to the Eternity II Puzzle. J. Math. Model. Algorithms 11(3): 217-233 (2012) - [j18]Peter Demeester, Burak Bilgin, Patrick De Causmaecker
A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice. J. Sched. 15(1): 83-103 (2012) - [c15]Rinde R. S. van Lon, Tom Holvoet
Evolutionary synthesis of multi-agent systems for dynamic dial-a-ride problems. GECCO (Companion) 2012: 331-336 - [c14]Tony Wauters
Fast Permutation Learning. LION 2012: 292-306 - [c13]Mustafa Misir
An Intelligent Hyper-Heuristic Framework for CHeSC 2011. LION 2012: 461-466 - [c12]Mustafa Misir
The Effect of the Set of Low-Level Heuristics on the Performance of Selection Hyper-heuristics. PPSN (2) 2012: 408-417 - 2011
- [j17]Pieter Vansteenwegen
The City Trip Planner: An expert system for tourists. Expert Syst. Appl. 38(6): 6540-6546 (2011) - [j16]Tony Wauters
Learning agents for the multi-mode project scheduling problem. J. Oper. Res. Soc. 62(2): 281-290 (2011) - [j15]Patrick De Causmaecker
A categorisation of nurse rostering problems. J. Sched. 14(1): 3-16 (2011) - 2010
- [j14]Peter Demeester, Wouter Souffriau, Patrick De Causmaecker
A hybrid tabu search algorithm for automatically assigning patients to beds. Artif. Intell. Medicine 48(1): 61-70 (2010) - [j13]Edmund K. Burke
A multi-objective approach for robust airline scheduling. Comput. Oper. Res. 37(5): 822-832 (2010) - [j12]Wouter Souffriau, Pieter Vansteenwegen
A Path Relinking approach for the Team Orienteering Problem. Comput. Oper. Res. 37(11): 1853-1859 (2010) - [j11]Peter Brucker, Edmund K. Burke
A shift sequence based approach for nurse scheduling and a new benchmark dataset. J. Heuristics 16(4): 559-573 (2010) - [j10]Edmund K. Burke
A scatter search methodology for the nurse rostering problem. J. Oper. Res. Soc. 61(11): 1667-1679 (2010) - [c11]Tony Wauters, Katja Verbeeck, Greet Vanden Berghe, Patrick De Causmaecker:
A game theoretic approach to decentralized multi-project scheduling. AAMAS 2010: 1415-1416 - [c10]Mustafa Misir
Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2009
- [j9]Pieter Vansteenwegen
Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36(12): 3281-3290 (2009) - [j8]Patrick De Causmaecker
A decomposed metaheuristic approach for a real-world university timetabling problem. Eur. J. Oper. Res. 195(1): 307-318 (2009) - [j7]Pieter Vansteenwegen
A guided local search metaheuristic for the team orienteering problem. Eur. J. Oper. Res. 196(1): 118-127 (2009) - [j6]Wout Dullaert
MamMoeT: An intelligent agent-based communication support platform for multimodal transport. Expert Syst. Appl. 36(7): 10280-10287 (2009) - [c9]Wouter Souffriau, Joris Maervoet, Pieter Vansteenwegen
A Mobile Tourist Decision Support System for Small Footprint Devices. IWANN (1) 2009: 1248-1255 - 2008
- [j5]Wouter Souffriau, Pieter Vansteenwegen
A Personalized Tourist Trip Design Algorithm for Mobile Tourist Guides. Appl. Artif. Intell. 22(10): 964-985 (2008) - [p1]Wouter Souffriau, Pieter Vansteenwegen
Automated Parameterisation of a Metaheuristic for the Orienteering Problem. Adaptive and Multilevel Metaheuristics 2008: 255-269 - 2007
- [c8]Pai-Chun Chen, Graham Kendall
An Ant Based Hyper-heuristic for the Travelling Tournament Problem. CISched 2007: 19-26 - 2006
- [j4]Edmund K. Burke
Metaheuristics for Handling Time Interval Coverage Constraints in Nurse Scheduling. Appl. Artif. Intell. 20(9): 743-766 (2006) - [j3]Stijn Bernaer, Martin Meganck
Designing trust with software agents: A case study. J. Inf. Commun. Ethics Soc. 4(1): 37-48 (2006) - 2004
- [j2]Edmund K. Burke
The State of the Art of Nurse Rostering. J. Sched. 7(6): 441-499 (2004) - [c7]Nele Custers, Patrick De Causmaecker
Semantic Components for Timetabling. PATAT 2004: 17-33 - [r1]Edmund Kieran Burke, Patrick De Causmaecker, Greet Vanden Berghe:
Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals. Handbook of Scheduling 2004 - 2002
- [b1]Greet Vanden Berghe:
An advanced model and novel meta-heuristic solution methods to personnel scheduling in healthcare. Katholieke Universiteit Leuven, Belgium, 2002 - [c6]Edmund K. Burke
A multi criteria meta-heuristic approach to nurse rostering. IEEE Congress on Evolutionary Computation 2002: 1197-1202 - [c5]Patrick De Causmaecker
Relaxation of Coverage Constraints in Hospital Personnel Rostering. PATAT 2002: 129-147 - [c4]Sanja Petrovic, Gareth Beddoe, Greet Vanden Berghe:
Storing and Adapting Repair Experiences in Employee Rostering. PATAT 2002: 148-165 - 2001
- [j1]Edmund K. Burke
A Memetic Approach to the Nurse Rostering Problem. Appl. Intell. 15(3): 199-214 (2001) - [c3]Patrick De Causmaecker
Sympathetic agents assist route in route planning. Agents 2001: 190-191 - [c2]Edmund K. Burke, Patrick De Causmaecker, Sanja Petrovic, Greet Vanden Berghe:
Fitness evaluation for nurse scheduling problems. CEC 2001: 1139-1146
1990 – 1999
- 1998
- [c1]Edmund K. Burke, Patrick De Causmaecker
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem. SEAL 1998: 187-194
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-12-01 01:09 CET 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: