default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLucas Kletzander
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Tommaso Mannelli Mazzoli
, Lucas Kletzander, Pascal Van Hentenryck, Nysret Musliu:
Investigating Large Neighbourhood Search for Bus Driver Scheduling. ICAPS 2024: 360-368- 2023
- [c12]Lucas Kletzander, Nysret Musliu:
Large-State Reinforcement Learning for Hyper-Heuristics. AAAI 2023: 12444-12452 - [c11]Lucas Kletzander, Nysret Musliu:
Dynamic Weight Setting for Personnel Scheduling with Many Objectives. ICAPS 2023: 509-517 - 2022
- [c10]Roberto Maria Rosati, Lucas Kletzander, Christian Blum, Nysret Musliu, Andrea Schaerf:
Construct, Merge, Solve and Adapt Applied to a Bus Driver Scheduling Problem with Complex Break Constraints. AI*IA 2022: 254-267 - [c9]Lucas Kletzander, Nysret Musliu:
Hyper-Heuristics for Personnel Scheduling Domains. ICAPS 2022: 462-470 - [c8]Tobias Geibinger, Lucas Kletzander, Nysret Musliu:
Instance Space Analysis for the Generalized Assignment Problem. MIC 2022: 421-435 - [c7]Lucas Kletzander, Tommaso Mannelli Mazzoli, Nysret Musliu:
Metaheuristic algorithms for the bus driver scheduling problem with complex break constraints. GECCO 2022: 232-240 - [p1]Lucas Kletzander:
Automatisierte Lösungsmethoden für Personalplanungsprobleme. Ausgezeichnete Informatikdissertationen 2022: 151-160 - 2021
- [j3]Lucas Kletzander, Nysret Musliu, Kate Smith-Miles:
Instance space analysis for a personnel scheduling problem. Ann. Math. Artif. Intell. 89(7): 617-637 (2021) - [c6]Lucas Kletzander, Nysret Musliu, Pascal Van Hentenryck:
Branch and Price for Bus Driver Scheduling with Complex Break Constraints. AAAI 2021: 11853-11861 - [c5]Tobias Geibinger, Lucas Kletzander, Matthias Krainz, Florian Mischek, Nysret Musliu, Felix Winter:
Physician Scheduling During a Pandemic. CPAIOR 2021: 456-465 - 2020
- [j2]Lucas Kletzander, Nysret Musliu:
Solving the general employee scheduling problem. Comput. Oper. Res. 113 (2020) - [c4]Lucas Kletzander, Nysret Musliu:
Solving Large Real-Life Bus Driver Scheduling Problems with Complex Break Constraints. ICAPS 2020: 421-430
2010 – 2019
- 2019
- [j1]Martin Josef Geiger, Lucas Kletzander, Nysret Musliu:
Solving the Torpedo Scheduling Problem. J. Artif. Intell. Res. 66: 1-32 (2019) - [c3]Lucas Kletzander, Nysret Musliu, Johannes Gärtner, Thomas Krennwallner, Werner Schafhauser:
Exact Methods for Extended Rotating Workforce Scheduling Problems. ICAPS 2019: 519-527 - [c2]Lucas Kletzander, Nysret Musliu:
Modelling and Solving the Minimum Shift Design Problem. CPAIOR 2019: 391-408 - 2017
- [c1]Lucas Kletzander, Nysret Musliu:
A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem. CPAIOR 2017: 344-358
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-08-05 21:15 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:
