Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINTO / 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/s10898-012-0006-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032020700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3095475 / 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: A random-key genetic algorithm for the generalized traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop / 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: Particle swarm optimization-based algorithms for TSP and generalized TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the covering design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Particle swarm optimization with chaotic opposition-based population initialization and stochastic search technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy genetic algorithm for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for flowshop lot streaming with setups and variable sublots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cooperative parallel tabu search algorithm for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3553687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete version of particle swarm optimization for flowshop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete particle swarm optimization for lot-streaming flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony approach to constrained redundancy optimization in binary systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problem with probability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / 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 Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multidimensional knapsack model for asset-backed securitization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A knapsack-type public key cryptosystem based on arithmetic in finite fields / 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: Numerical Analysis and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel search: a general heuristic for the multi-dimensional knapsack problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:12, 7 July 2024

scientific article
Language Label Description Also known as
English
Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
scientific article

    Statements

    Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (English)
    0 references
    7 November 2013
    0 references
    combinatorial optimization problem
    0 references
    NP-hard problem
    0 references
    meta-heuristic algorithm
    0 references
    binary particle swarm optimization
    0 references
    binary accelerated particle swarm algorithm
    0 references
    multidimensional knapsack problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers