Simulated annealing for the 0/1 multidimensional knapsack problem

MaRDI QIDQ3610109zbMATH OpenFDO

Authors Fubin Qian, Rui Ding

Publication date 6 March 2009

zbMATH Keywords

numerical examplesgenetic algorithmcomparison of methodssimulated annealing algorithmmultidimensional knapsack problemfinite-time implementation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic programming (90C15)

Recommendations

• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• A kind of renewed simulated annealing algorithm solves 0-1 knapsack problem
• A Simulated Annealing Algorithm for General Zero-One Programming Problems
• A genetic algorithm for the multidimensional knapsack problem
• General Purpose Simulated Annealing

Cited in

(10)

• scientific article; zbMATH DE number 1488895 (Why is no real title available?)
• The effect of dynamic penalty function on solution of quadratic knapsack problem with simulated annealing algorithm
• A kind of renewed simulated annealing algorithm solves 0-1 knapsack problem
• Revenue maximization of Internet of Things provider using variable neighbourhood search
• A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems
• A RNN-based hyper-heuristic for combinatorial problems
• A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
• Information technology capital budgeting using a knapsack problem
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• scientific article; zbMATH DE number 4211814 (Why is no real title available?)

This page was built for publication: Simulated annealing for the 0/1 multidimensional knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3610109)