Improving problem reduction for 0–1 Multidimensional Knapsack Problems with valid inequalities
Author:
- 1 July 2016
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 71, 82-89
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problemComputers & Operations Research, 2012
- A multi-level search strategy for the 0–1 Multidimensional Knapsack ProblemDiscrete Applied Mathematics, 2010
- New convergent heuristics for 0–1 mixed integer programmingEuropean Journal of Operational Research, 2009
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problemJournal of Combinatorial Optimization, 2007
- A survey of effective heuristics and their application to a variety of knapsack problemsIMA Journal of Management Mathematics, 2007
- The Multidimensional 0-1 Knapsack Problem—Bounds and Computational AspectsAnnals of Operations Research, 2005
- Improved results on the 0–1 multidimensional knapsack problemEuropean Journal of Operational Research, 2005
- The multidimensional 0–1 knapsack problem: An overviewEuropean Journal of Operational Research, 2004
- A Genetic Algorithm for the Multidimensional Knapsack ProblemJournal of Heuristics, 1998
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980