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
Travelling Sales Person Problem Using Soft Computing – Gene..:
, In:
2022 4th International Conference on Advances in Computing, Communication Control and Networking (ICAC3N)
,
Borad, Abhinav
;
Akhil, Karnam
;
Madhavi, A
.. - p. 790-800 , 2022
Link:
https://doi.org/10.1109/ICAC3N56670.2022.10074286
RT T1 <cTitle>2022 4th International Conference on Advances in Computing, Communication Control and Networking (ICAC3N)</cTitle>: T1 <Title>Travelling Sales Person Problem Using Soft Computing – Genetic Algorithm Techniques</Title> UL https://suche.suub.uni-bremen.de/peid=ieee-10074286&Exemplar=1&LAN=DE A1 Borad, Abhinav A1 Akhil, Karnam A1 Madhavi, A A1 Alankritha, Sampath A1 Akhil, Mandalapu YR 2022 K1 Ant colony optimization K1 Heuristic algorithms K1 Urban areas K1 Programming K1 Real-time systems K1 Space exploration K1 Dynamic programming K1 Genetic Algorithms (GAs) K1 Soft computing K1 Ant System (AS) K1 Dynamic Programming (DP) K1 NP-Hard Optimization Problem K1 Combinatorial Optimization Problem (COP) K1 Dynamic Combinatorial Optimization Problems (DCOP) SP 790 OP 800 LK http://dx.doi.org/https://doi.org/10.1109/ICAC3N56670.2022.10074286 DO https://doi.org/10.1109/ICAC3N56670.2022.10074286 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
