default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDarko Drakulic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Darko Drakulic, Sofia Michel, Jean-Marc Andreoli:
GOAL: A Generalist Combinatorial Optimization Agent Learner. CoRR abs/2406.15079 (2024)- 2023
- [j2]Darko Drakulic, Christelle Loiodice, Vassilissa Lehoux:
Routing in Multimodal Transportation Networks with Non-scheduled Lines. ACM J. Exp. Algorithmics 28: 2.3:1-2.3:16 (2023) - [c7]Darko Drakulic, Sofia Michel, Florian Mai, Arnaud Sors, Jean-Marc Andreoli:
BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization. NeurIPS 2023 - [i3]Darko Drakulic, Sofia Michel, Florian Mai, Arnaud Sors, Jean-Marc Andreoli:
BQ-NCO: Bisimulation Quotienting for Generalizable Neural Combinatorial Optimization. CoRR abs/2301.03313 (2023) - 2022
- [c6]Sahil Manchanda, Sofia Michel, Darko Drakulic, Jean-Marc Andreoli:
On the Generalization of Neural Combinatorial Optimization Heuristics. ECML/PKDD (5) 2022: 426-442 - [c5]Darko Drakulic, Christelle Loiodice, Vassilissa Lehoux
:
Routing in Multimodal Transportation Networks with Non-Scheduled Lines. SEA 2022: 6:1-6:15 - [i2]Darko Drakulic, Jean-Marc Andreoli:
Structured Time Series Prediction without Structural Prior. CoRR abs/2202.03539 (2022) - [i1]Sahil Manchanda, Sofia Michel, Darko Drakulic, Jean-Marc Andreoli:
On the Generalization of Neural Combinatorial Optimization Heuristics. CoRR abs/2206.00787 (2022)
2010 – 2019
- 2019
- [c4]Vassilissa Lehoux, Darko Drakulic:
Mode Personalization in Trip-Based Transit Routing. ATMOS 2019: 13:1-13:15 - 2016
- [j1]Darko Drakulic, Aleksandar Takaci, Miroslav Maric:
New Model of Maximal Covering Location Problem with Fuzzy Conditions. Comput. Informatics 35(3): 635-652 (2016) - 2014
- [c3]Aleksandar Takaci, Ivana Stajner-Papuga, Miroslav Maric, Darko Drakulic:
A note on the use of Choquet and Sugeno integrals in minimal and maximal covering location problems. SISY 2014: 159-162 - 2013
- [c2]Aleksandar Takaci, Miroslav Maric, Darko Drakulic:
Solving minimal covering location problem (MinCLP) with the aid of fuzzy sets. SISY 2013: 177-180 - 2012
- [c1]Aleksandar Takaci, Miroslav Maric, Darko Drakulic:
The role of fuzzy sets in improving maximal covering location problem (MCLP). SISY 2012: 103-106
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-07-17 21:25 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:
