Ant algorithms: theory and applications (Q2432976): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11086-005-0029-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004186912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms of ant system and simulated annealing for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rank based version of the ant system. -- A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Algorithms: Foundations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of the keyboard arrangement problem using an ant colony algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning cooperative linguistic fuzzy rules using the best-worst ant system algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480099 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:16, 24 June 2024

scientific article
Language Label Description Also known as
English
Ant algorithms: theory and applications
scientific article

    Statements

    Ant algorithms: theory and applications (English)
    0 references
    0 references
    26 October 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete optimization
    0 references
    traveling salesman problem
    0 references
    vehicle routing problem
    0 references
    graph coloring
    0 references
    quadratic assignment problem
    0 references
    network-traffic optimization
    0 references
    complex combinatorial optimization problems
    0 references
    job-shop scheduling problem
    0 references
    0 references