Meta-RaPS approach for the 0-1 Multidimensional Knapsack Problem
Authors:
- Reinaldo J. MoragaRMReinaldo J. Moraga
- Gail W. DePuyGDGail W. DePuy
- Gary E. WhitehouseGWGary E. Whitehouse
- 1 January 2005
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 48 (1) , 83-96
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- An Approximate Dynamic Programming Approach to Multidimensional Knapsack ProblemsManagement Science, 2002
- A Genetic Algorithm for the Multidimensional Knapsack ProblemJournal of Heuristics, 1998
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- An efficient preprocessing procedure for the multidimensional 0–1 knapsack problemDiscrete Applied Mathematics, 1994
- Dynamic tabu list management using the reverse elimination methodAnnals of Operations Research, 1993
- A simulated annealing approach to the multiconstraint zero-one knapsack problemComputing, 1988
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimalityMathematical Programming, 1985
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- The Theory and Computation of Knapsack FunctionsOperations Research, 1966
- A COMPUTER METHOD OF SEQUENCING OPERATIONS FOR ASSEMBLY LINESInternational Journal of Production Research, 1965