default search action
Dimitris Souravlias
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]T. van der Beek, Dimitris Souravlias, J. Theresia van Essen, Jeroen Pruyn, Karen I. Aardal:
Hybrid differential evolution algorithm for the resource constrained project scheduling problem with a flexible project structure and consumption and production of resources. Eur. J. Oper. Res. 313(1): 92-111 (2024) - 2020
- [c9]Yimeng Zhang, Bilge Atasoy, Dimitris Souravlias, Rudy R. Negenborn:
Pickup and Delivery Problem with Transshipment for Inland Waterway Transport. ICCL 2020: 18-35 - [c8]Nadia Pourmohammad Zia, Frederik Schulte, Dimitris Souravlias, Rudy R. Negenborn:
Platooning of Automated Ground Vehicles to Connect Port and Hinterland: A Multi-objective Optimization Approach. ICCL 2020: 428-442
2010 – 2019
- 2019
- [j4]Dimitris Souravlias, Ilias S. Kotsireas, Panos M. Pardalos, Konstantinos E. Parsopoulos:
Parallel algorithm portfolios with performance forecasting. Optim. Methods Softw. 34(6): 1231-1250 (2019) - [e1]Ilias S. Kotsireas, Panos M. Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias, Arsenis Tsokas:
Analysis of Experimental Algorithms - Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers. Lecture Notes in Computer Science 11544, Springer 2019, ISBN 978-3-030-34028-5 [contents] - 2018
- [c7]Dimitris Souravlias, Sandra Huber:
Detecting Patterns in Benchmark Instances of the Swap-Body Vehicle Routing Problem. LION 2018: 370-385 - 2017
- [b1]Dimitris Souravlias:
New approaches in parallel algorithm portfolios for metaheuristic optimization. University of Ioannina, Greece, 2017 - [j3]Dimitris Souravlias, Konstantinos E. Parsopoulos, Gerasimos C. Meletiou:
Designing bijective S-boxes using Algorithm Portfolios with limited time budgets. Appl. Soft Comput. 59: 475-486 (2017) - 2016
- [j2]Dimitris Souravlias, Konstantinos E. Parsopoulos:
Particle swarm optimization with neighborhood-based budget allocation. Int. J. Mach. Learn. Cybern. 7(3): 451-477 (2016) - [j1]Dimitris Souravlias, Konstantinos E. Parsopoulos, Ilias S. Kotsireas:
Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics. Optim. Lett. 10(6): 1303-1314 (2016) - [c6]Dimitris Souravlias, Gabriel Luque, Enrique Alba, Konstantinos E. Parsopoulos:
Smart Traffic Lights: A First Parallel Computing Approach. INCoS 2016: 229-236 - [c5]Ilias S. Kotsireas, Panos M. Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias:
On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-core Processors. SEA 2016: 184-200 - 2014
- [c4]Dimitris Souravlias, Konstantinos E. Parsopoulos, Enrique Alba:
Parallel Algorithm Portfolio with Market Trading-Based Time Allocation. OR 2014: 567-574 - 2013
- [c3]Dimitris Souravlias, Konstantinos E. Parsopoulos:
Particle swarm optimization with budget allocation through neighborhood ranking. GECCO 2013: 105-112 - [i1]Georgia Koloniari, Dimitris Souravlias, Evaggelia Pitoura:
On Graph Deltas for Historical Queries. CoRR abs/1302.5549 (2013) - 2011
- [c2]Georgia Koloniari, Nikos Ntarmos, Evaggelia Pitoura, Dimitris Souravlias:
One is enough: distributed filtering for duplicate elimination. CIKM 2011: 433-442 - 2010
- [c1]Dimitris Souravlias, Marina Drosou, Kostas Stefanidis, Evaggelia Pitoura:
On novelty in publish/subscribe delivery. ICDE Workshops 2010: 20-22
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-06-19 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint