default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBoldizsár Tüü-Szabó
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2021
[b1]Boldizsár Tüü-Szabó:
Diszkrét optimalizálási problémák kezelése populáció alapú evolúciós algoritmusokkal. Széchenyi István University, Hungary, 2021
Journal Articles
- 2023
- [j6]Levente Fazekas, Boldizsár Tüü-Szabó, László T. Kóczy, Olivér Hornyák
, Károly Nehéz:
A Hybrid Discrete Memetic Algorithm for Solving Flow-Shop Scheduling Problems. Algorithms 16(9): 406 (2023) - 2020
- [j5]Ruba Almahasneh, Boldizsár Tüü-Szabó, László T. Kóczy, Péter Földesi:
Optimization of the Time-Dependent Traveling Salesman Problem Using Interval-Valued Intuitionistic Fuzzy Sets. Axioms 9(2): 53 (2020) - [j4]Boldizsár Tüü-Szabó, Péter Földesi, László T. Kóczy:
An Efficient Evolutionary Metaheuristic for the Traveling Repairman (Minimum Latency) Problem. Int. J. Comput. Intell. Syst. 13(1): 781-793 (2020) - 2018
- [j3]Boldizsár Tüü-Szabó, László T. Kóczy, Mónika Fuxreiter:
Simulations of Higher-Order Protein Organizations Using a Fuzzy Framework. Complex. 2018: 6360846:1-6360846:10 (2018) - [j2]László T. Kóczy, Péter Földesi, Boldizsár Tüü-Szabó:
Enhanced discrete bacterial memetic evolutionary algorithm - An efficacious metaheuristic for the traveling salesman optimization. Inf. Sci. 460-461: 389-400 (2018) - 2017
- [j1]László T. Kóczy, Péter Földesi, Boldizsar Tuu-Szabo:
An effective Discrete Bacterial Memetic Evolutionary Algorithm for the Traveling Salesman Problem. Int. J. Intell. Syst. 32(8): 862-876 (2017)
Conference and Workshop Papers
- 2021
- [c9]Ali Jawad Ibada, Boldizsar Tuu-Szabo, László T. Kóczy:
A new efficient tour construction heuristic for the Traveling Salesman Problem. ISMSI 2021: 71-76 - 2020
- [c8]Ruba Almahasneh, Boldizsar Tuu-Szabo, Péter Földesi, László T. Kóczy:
Fuzzy Set Based Models Comparative Study for the TD TSP with Rush Hours and Traffic Regions. IPMU (2) 2020: 699-714 - [c7]Ruba Almahasneh, Boldizsar Tuu-Szabo, Péter Földesi, László T. Kóczy:
Extension of the Time Dependent Travelling Salesman Problem with Interval Valued Intuitionistic Fuzzy Model Applying Memetic Optimization Algorithm. ISMSI 2020: 111-118 - 2019
- [c6]László T. Kóczy, Péter Földesi, Boldizsar Tuu-Szabo, Ruba Almahasneh:
Modeling of Fuzzy Rule-base Algorithm for the Time Dependent Traveling Salesman Problem. FUZZ-IEEE 2019: 1-6 - [c5]Ruba Almahasneh, Boldizsar Tuu-Szabo, Péter Földesi, László T. Kóczy:
Intuitionistic Fuzzy Model of Traffic Jam Regions and Rush Hours for the Time Dependent Traveling Salesman Problem. IFSA/NAFIPS 2019: 123-134 - [c4]Boldizsár Tüü-Szabó, Péter Földesi, László T. Kóczy:
Statistical Analysis of the Performance of the State-of-the-Art Methods for Solving TSP Variants. MIWAI 2019: 255-262 - 2018
- [c3]Boldizsár Tüü-Szabó, Péter Földesi, László T. Kóczy:
Discrete Bacterial Memetic Evolutionary Algorithm for the Time Dependent Traveling Salesman Problem. IPMU (1) 2018: 523-533 - 2017
- [c2]Boldizsár Tüü-Szabó, Péter Földesi, László T. Kóczy:
An Efficient New Memetic Method for the Traveling Salesman Problem with Time Windows. MIWAI 2017: 426-436 - 2016
- [c1]László T. Kóczy, Péter Földesi, Boldizsar Tuu-Szabo:
A discrete bacterial memetic evolutionary algorithm for the traveling salesman problem. CEC 2016: 3261-3267
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 2025-01-21 00:17 CET 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:
