default search action
Pieter Leyman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Dieter Brughmans
, Pieter Leyman, David Martens:
NICE: an algorithm for nearest instance counterfactual explanations. Data Min. Knowl. Discov. 38(5): 2665-2703 (2024) - 2023
- [j10]Jorik Jooken
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems. Comput. Oper. Res. 150: 106070 (2023) - [j9]Jorik Jooken
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions. Eur. J. Oper. Res. 311(1): 36-55 (2023) - [c1]Reza Ghorbani Saber
Mixed Integer Programming for Integrated Flexible Job-Shop and Operator Scheduling in Flexible Manufacturing Systems. APMS (4) 2023: 460-470 - 2022
- [j8]Duy-Hoang Tran
Adaptive passenger-finding recommendation system for taxi drivers with load balancing problem. Comput. Ind. Eng. 169: 108187 (2022) - [j7]Jorik Jooken
A new class of hard problem instances for the 0-1 knapsack problem. Eur. J. Oper. Res. 301(3): 841-854 (2022) - [i5]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions. CoRR abs/2211.09665 (2022) - 2021
- [j6]Duy-Hoang Tran
Local search for constrained graph clustering in biological networks. Comput. Oper. Res. 132: 105299 (2021) - 2020
- [j5]Jorik Jooken
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs. J. Heuristics 26(5): 743-769 (2020) - [j4]Tu-San Pham, Pieter Leyman
The intermittent travelling salesman problem. Int. Trans. Oper. Res. 27(1): 525-548 (2020) - [i4]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker, Tony Wauters:
Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem. CoRR abs/2010.11523 (2020)
2010 – 2019
- 2019
- [j3]Pieter Leyman
The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models. Comput. Oper. Res. 103: 184-197 (2019) - [i3]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker:
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs. CoRR abs/1904.11337 (2019) - 2017
- [j2]Pieter Leyman
Capital- and resource-constrained project scheduling with net present value optimization. Eur. J. Oper. Res. 256(3): 757-776 (2017) - [i2]Pieter Leyman, San Tu Pham, Patrick De Causmaecker:
The Intermittent Traveling Salesman Problem with Different Temperature Profiles: Greedy or not? CoRR abs/1701.08517 (2017) - [i1]Pieter Leyman, Patrick De Causmaecker:
Optimization in large graphs: Toward a better future? CoRR abs/1705.08277 (2017) - 2016
- [j1]Pieter Leyman
Payment models and net present value optimization for resource-constrained project scheduling. Comput. Ind. Eng. 91: 139-153 (2016)
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-09-21 23:41 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: