Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/jmma/AzadRF15, #quickstatements; #temporary_batch_1731468600454
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Greedy algorithm for the general multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified Binary Particle Swarm Optimization for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Enumeration Algorithm for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An artificial fish swarm algorithm based hyperbolic augmented Lagrangian method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3515603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing approach to the multiconstraint zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A statistical analysis of the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multidimensional 0-1 knapsack problem: an overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ant colony optimization approach for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new ant colony optimization algorithm for the multidimensional Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic solution procedure for the multiconstraint zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multidimensional Knapsack Problem: Structure and Algorithms / 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: Genetic algorithms with double strings for 0-1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The growth of m-constraint random knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-one programming with many variables and few constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on the 0--1 multidimensional knapsack problem / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jmma/AzadRF15 / rank
 
Normal rank

Latest revision as of 04:41, 13 November 2024

scientific article
Language Label Description Also known as
English
Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
scientific article

    Statements

    Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (English)
    0 references
    1 December 2015
    0 references
    artificial fish swarm
    0 references
    heuristic search
    0 references
    0-1 knapsack problem
    0 references
    multidimensional knapsack
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers