A new ant colony optimization algorithm for the multidimensional Knapsack problem (Q2471237): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ACOTSP / 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.1016/j.cor.2006.12.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982976253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colonies for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank

Latest revision as of 17:39, 27 June 2024

scientific article
Language Label Description Also known as
English
A new ant colony optimization algorithm for the multidimensional Knapsack problem
scientific article

    Statements

    A new ant colony optimization algorithm for the multidimensional Knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2008
    0 references
    0 references
    ant colony optimization
    0 references
    binary ant system
    0 references
    combinatorial optimization
    0 references
    multidimensional Knapsack problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references