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
An approach of ant algorithm for solving minimum routing co..:
, In:
Proceedings of the Second Symposium on Information and Communication Technology
,
Hieu, Nguyen Minh
;
Quoc, PhanTan
;
Nghia, Nguyen Duc
- p. 5-10 , 2011
Link:
https://dl.acm.org/doi/10.1145/2069216.2069222
RT T1 <cTitle>Proceedings of the Second Symposium on Information and Communication Technology</cTitle>: T1 <Title>An approach of ant algorithm for solving minimum routing cost spanning tree problem</Title> UL https://suche.suub.uni-bremen.de/peid=acm-2069222&Exemplar=1&LAN=DE A1 Hieu, Nguyen Minh A1 Quoc, PhanTan A1 Nghia, Nguyen Duc PB ACM YR 2011 K1 ant algorithm K1 approximate algorithm K1 metaheuristics K1 minimum routing cost spanning tree K1 pheromone trail K1 Theory of computation K1 Design and analysis of algorithms K1 Approximation algorithms analysis K1 Routing and network design problems K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Trees SP 5 OP 10 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/2069216.2069222 DO https://dl.acm.org/doi/10.1145/2069216.2069222 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
