A simulated annealing approach to the multiconstraint zero-one knapsack problem
From MaRDI portal
Recommendations
- Simulated annealing for the 0/1 multidimensional knapsack problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A Simulated Annealing Algorithm for General Zero-One Programming Problems
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
- scientific article; zbMATH DE number 1302173
Cites work
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 3767009 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- An Algorithm for Large Zero-One Knapsack Problems
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Euclidean matching problems and the metropolis algorithm
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- Probabilistic exchange algorithms and Euclidean traveling salesman problems
- Reconstruction of polycrystalline structures: a new application of combinatorial optimization
- The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
Cited in
(38)- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A heuristic algorithm for resource allocation/reallocation problem
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
- A kind of renewed simulated annealing algorithm solves 0-1 knapsack problem
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
- A new hybrid method for solving global optimization problem
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- Probabilistic and deterministic local search for solving the binary multiknapsack problem
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- Dynamic tabu list management using the reverse elimination method
- Simulated annealing: An initial application in econometrics
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Profit margin oriented course scheduling at Lufthansa Technical Training Ltd.
- Global optimization and multi knapsack: a percolation algorithm.
- A RNN-based hyper-heuristic for combinatorial problems
- An improved typology of cutting and packing problems
- Methods for the one-dimensional space allocation problem
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- A Simulated Annealing Algorithm for General Zero-One Programming Problems
- Improved results on the 0--1 multidimensional knapsack problem
- Global optimization of statistical functions with simulated annealing
- Simulated annealing for the 0/1 multidimensional knapsack problem
- An efficient algorithm to allocate shelf space
- Essential particle swarm optimization queen with tabu search for MKP resolution
- A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs
- The multidimensional 0-1 knapsack problem: an overview.
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Metaheuristics: A bibliography
- Solving zero-one mixed integer programming problems using tabu search
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
This page was built for publication: A simulated annealing approach to the multiconstraint zero-one knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099588)
