Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
Authors:
- 1 January 2012
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 39 (1) , 27-31
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A multi-level search strategy for the 0–1 Multidimensional Knapsack ProblemDiscrete Applied Mathematics, 2010
- Improved convergent heuristics for the 0-1 multidimensional knapsack problemAnnals of Operations Research, 2009
- The Multidimensional 0-1 Knapsack Problem—Bounds and Computational AspectsAnnals of Operations Research, 2005
- Exploring relaxation induced neighborhoods to improve MIP solutionsMathematical Programming, 2004
- The multidimensional 0–1 knapsack problem: An overviewEuropean Journal of Operational Research, 2004
- Local branchingMathematical Programming, 2003
- A Computational Study of Search Strategies for Mixed Integer ProgrammingINFORMS Journal on Computing, 1999
- A Genetic Algorithm for the Multidimensional Knapsack ProblemJournal of Heuristics, 1998
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- An Algorithm for the Solution of Mixed Integer Programming ProblemsManagement Science, 1966