- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
New Ant Colony Optimization Algorithm for the Traveling Salesman Problem ; volume:13 ; number:1 ; day:22 ; month:1 ; year:2020 ; pages:44-55 ; date:1.2020
International journal of computational intelligence systems ; 13, Heft 1 (22.1.2020), 44-55, 1.2020
- Creator
-
Gao, Wei
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.2991/ijcis.d.200117.001
- URN
-
urn:nbn:de:101:1-2024041316325511026004
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 14.08.2025, 10:53 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Gao, Wei
- SpringerLink (Online service)
Other Objects (12)
The minimum exponential atom-bond connectivity energy of trees
Modified Ant Colony Optimization Algorithm for Multiple-vehicle Traveling Salesman Problems
Konstruktion eines Hochaperturscanners
The generalized traveling salesman problem solved with ant algorithms
The traveling salesman problem
The Traveling Salesman Problem
Das Traveling-Salesman-Problem, [1]
Determinants of the behavioral intention to use a mobile nursing application by nurses in China
Approximation analysis of ontology learning algorithm in linear combination setting
Two-distance vertex-distinguishing index of sparse graphs
Parameters and fractional factors in different settings
Airport time profile construction driven by flight delay prediction
The minimum exponential atom-bond connectivity energy of trees
Modified Ant Colony Optimization Algorithm for Multiple-vehicle Traveling Salesman Problems
Konstruktion eines Hochaperturscanners
The generalized traveling salesman problem solved with ant algorithms
The traveling salesman problem
The Traveling Salesman Problem
Das Traveling-Salesman-Problem, [1]
Determinants of the behavioral intention to use a mobile nursing application by nurses in China
Approximation analysis of ontology learning algorithm in linear combination setting
Two-distance vertex-distinguishing index of sparse graphs
Parameters and fractional factors in different settings
Airport time profile construction driven by flight delay prediction
The minimum exponential atom-bond connectivity energy of trees
Modified Ant Colony Optimization Algorithm for Multiple-vehicle Traveling Salesman Problems
Konstruktion eines Hochaperturscanners
The generalized traveling salesman problem solved with ant algorithms
The traveling salesman problem
The Traveling Salesman Problem
Das Traveling-Salesman-Problem, [1]
Determinants of the behavioral intention to use a mobile nursing application by nurses in China
Approximation analysis of ontology learning algorithm in linear combination setting
Two-distance vertex-distinguishing index of sparse graphs
Parameters and fractional factors in different settings