A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems (Q2349685): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cam.2013.09.052 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Genocop / 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.cam.2013.09.052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066653502 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57573511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Miniaturized'' linearizations for quadratic 0/1 problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Methods For Solving Quadratic 0–1 Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented Lagrangian fish swarm based method for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873721 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jcam/AzadRF14 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CAM.2013.09.052 / rank
 
Normal rank

Latest revision as of 03:27, 18 December 2024

scientific article
Language Label Description Also known as
English
A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
scientific article

    Statements

    A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems (English)
    0 references
    17 June 2015
    0 references
    0-1 knapsack problem
    0 references
    heuristic
    0 references
    artificial fish swarm
    0 references
    swap move
    0 references
    0 references
    0 references

    Identifiers