I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Comparative Approach of Computational Models Applied to the..:
, In:
2021 6th International Conference on Smart and Sustainable Technologies (SpliTech)
,
Da Costa, Joao V.
;
De Aragao, Anderson P.
;
de L. Veras, Necio
.. - p. 1-6 , 2021
Link:
https://doi.org/10.23919/SpliTech52315.2021.9566377
RT T1 <cTitle>2021 6th International Conference on Smart and Sustainable Technologies (SpliTech)</cTitle>: T1 <Title>Comparative Approach of Computational Models Applied to the Traveling Salesman Problem: A Case Study Performed at Tourist Points in the Ibiapaba Mountains, CE, Brazil</Title> UL https://suche.suub.uni-bremen.de/peid=ieee-9566377&Exemplar=1&LAN=DE A1 Da Costa, Joao V. A1 De Aragao, Anderson P. A1 de L. Veras, Necio A1 Rabelo, Ricardo A. L. A1 Rodrigues, Joel J. P. C. YR 2021 K1 Runtime K1 Scalability K1 Force K1 Traveling salesman problems K1 Tools K1 Hardware K1 Time measurement K1 Optimization K1 Traveling Salesman Problem K1 2-OPT K1 Ant Colony Optimization K1 Genetic Algorithm SP 1 OP 6 LK http://dx.doi.org/https://doi.org/10.23919/SpliTech52315.2021.9566377 DO https://doi.org/10.23919/SpliTech52315.2021.9566377 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
