Essential particle swarm optimization queen with tabu search for MKP resolution
From MaRDI portal
(Redirected from Publication:488403)
Recommendations
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
- The hybrid tabu search and particle swarm optimization algorithm for mixed discrete optimization problems
- A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
Cites work
- scientific article; zbMATH DE number 1617337 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A genetic algorithm for the multidimensional knapsack problem
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- A review of particle swarm optimization. I: Background and development
- A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- An algorithm for the solution of the 0-1 knapsack problem
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Ant colony optimization.
- Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming
- Competitive analysis for dynamic multiperiod uncapacitated routing problems
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Future paths for integer programming and links to artificial intelligence
- Improved results on the 0--1 multidimensional knapsack problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Numerical Analysis and Its Applications
- Pivot and Complement–A Heuristic for 0-1 Programming
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Some Convergence Results for Probabilistic Tabu Search
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu search techniques. A tutorial and an application to neural networks
- The Theory and Computation of Knapsack Functions
- The multidimensional knapsack problem: structure and algorithms
Cited in
(5)- Heuristic algorithm for topology optimization of continuum structure
- A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- A comprehensive survey on particle swarm optimization algorithm and its applications
- Gompertz PSO variants for knapsack and multi-knapsack problems
This page was built for publication: Essential particle swarm optimization queen with tabu search for MKP resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488403)
