![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Dimitrios C. Tselios
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Evangelos Paschalis, Nikolaos Xafoulis, Nikolaos Alamanis, Grigorios C. Papageorgiou, Dimitrios C. Tselios
, Anna Zahidou, Ilias Boufikos:
Can Reservoirs Combine Flood Protection and Irrigation? A Case Study for Larissa City, Greece. Oper. Res. Forum 5(1): 16 (2024) - [c10]Leonidas G. Anthopoulos
, Maria Karakidi, Dimitrios C. Tselios
:
Defining the "Smart Hospital": A Literature Review. WorldCIST (2) 2024: 150-157
2010 – 2019
- 2019
- [j3]Ilias K. Savvas
, Dimitrios C. Tselios
, Georgia Garani
:
Distributed and multi-core version of k-means algorithm. Int. J. Grid Util. Comput. 10(3): 283-291 (2019) - 2017
- [c9]Ilias K. Savvas
, Dimitrios C. Tselios
:
Combining Distributed and Multi-core Programming Techniques to Increase the Performance of K-Means Algorithm. WETICE 2017: 95-100 - 2016
- [j2]Dimitrios C. Tselios
, Ilias K. Savvas, M. Tahar Kechadi
:
Phased Method for Solving Multi-Objective MPM Job Shop Scheduling Problem. Int. J. Monit. Surveillance Technol. Res. 4(1): 42-61 (2016) - [c8]Ilias K. Savvas
, Dimitrios C. Tselios
:
Parallelizing DBSCaN Algorithm Using MPI. WETICE 2016: 77-82 - 2015
- [c7]Dimitrios C. Tselios
, Pandelis G. Ipsilandis, Vassilis C. Gerogiannis
:
A Dynamic Programming Approach for Solving the IFM Based Project Scheduling Problem. EUROMICRO-SEAA 2015: 127-134 - [c6]Dimitrios C. Tselios
, Pandelis G. Ipsilandis, Vassilis C. Gerogiannis
:
A dynamic programming algorithm for optimizing the financial return of software projects. IISA 2015: 1-6 - [c5]Dimitrios C. Tselios
, Ilias K. Savvas
, M. Tahar Kechadi
:
Integrated intelligent method for solving multi-objective MPM job shop scheduling problem. IISA 2015: 1-6 - 2013
- [j1]Dimitrios C. Tselios
, Ilias K. Savvas
, M. Tahar Kechadi
:
Multiple project portfolio scheduling using recurrent neural networks. Int. J. Simul. Process. Model. 8(4): 227-240 (2013) - [c4]Dimitrios C. Tselios
, Ilias K. Savvas
, M. Tahar Kechadi
:
RNN Modelling for Bi-Objective MPM Job Shop Scheduling Problem. CICSyN 2013: 13-18 - 2012
- [c3]Dimitrios C. Tselios
, Ilias K. Savvas
, M. Tahar Kechadi
:
Project Portfolio: A Job Scheduling Approach. CISIS 2012: 847-852 - [c2]Dimitrios C. Tselios
, Ilias K. Savvas
, M. Tahar Kechadi
:
The Weighted Tardiness as Objective Function of a RNN Model for the Job Scheduling Problem. EMS 2012: 15-20
2000 – 2009
- 2008
- [c1]Ilias K. Savvas
, Dimitrios C. Tselios
, George Kakarontzas
:
Quality Interplay in Regular vs. Irregular Grid Topologies. WETICE 2008: 176-181
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-05-19 00:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint