Остановите войну!
for scientists:
default search action
Greet Vanden Berghe
- > Home > Persons > Greet Vanden Berghe
Publications
- 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, Greet Vanden Berghe:
An Algorithm for Generating a Diverse Set of Multi-Modal Journeys. Algorithms 15(11): 416 (2022) - [j84]Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe:
Truck driver scheduling with interdependent routes and working time constraints. EURO J. Transp. Logist. 11: 100092 (2022) - [j83]Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe:
Scheduling truck drivers with interdependent routes under European Union regulations. Eur. J. Oper. Res. 298(1): 76-88 (2022) - 2021
- [j78]Elín Björk Böðvarsdóttir, Pieter Smet, Greet Vanden Berghe, Thomas J. R. Stidsen:
Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds. Eur. J. Oper. Res. 292(3): 980-995 (2021) - [j75]Toni Ismael Wickert, Pieter Smet, Greet Vanden Berghe:
Quantifying and enforcing robustness in staff rostering. J. Sched. 24(3): 347-366 (2021) - [c22]Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe:
Efficient Duration-Based Workload Balancing for Interdependent Vehicle Routes. ATMOS 2021: 1:1-1:15 - 2019
- [j65]Toni Ismael Wickert, Pieter Smet, Greet Vanden Berghe:
The nurse rerostering problem: Strategies for reconstructing disrupted schedules. Comput. Oper. Res. 104: 319-337 (2019) - 2017
- [j56]Pieter Smet, Fabio Salassa, Greet Vanden Berghe:
Local and global constraint consistency in personnel rostering. Int. Trans. Oper. Res. 24(5): 1099-1117 (2017) - 2016
- [j53]Pieter Smet, Andreas T. Ernst, Greet Vanden Berghe:
Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem. Comput. Oper. Res. 76: 60-72 (2016) - [j52]Pieter Smet, Peter Brucker, Patrick De Causmaecker, Greet Vanden Berghe:
Polynomially solvable personnel rostering problems. Eur. J. Oper. Res. 249(1): 67-75 (2016) - [j45]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
- [j43]Mustafa Misir, Pieter Smet, Greet Vanden Berghe:
An analysis of generalised heuristics for vehicle routing and personnel rostering problems. J. Oper. Res. Soc. 66(5): 858-870 (2015) - 2014
- [j40]Pieter Smet, Burak Bilgin, Patrick De Causmaecker, Greet Vanden Berghe:
Modelling and evaluation issues in nurse rostering. Ann. Oper. Res. 218(1): 303-326 (2014) - 2013
- [j31]Simon Martin, Djamila Ouelhadj, Pieter Smet, Greet Vanden Berghe, Ender Özcan:
Cooperative search for fair nurse rosters. Expert Syst. Appl. 40(16): 6674-6683 (2013) - [p3]Pieter Smet, Patrick De Causmaecker, Burak Bilgin, Greet Vanden Berghe:
Nurse Rostering: A Complex Example of Personnel Scheduling with Perspectives. Automated Scheduling and Planning 2013: 129-153
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:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint