Computational experience with a core-based reduction procedure for the 2-knapsack problem

DOI10.1016/J.COR.2010.07.011zbMATH Open1231.90321OpenAlexW1995896424MaRDI QIDQ709198FDOQ709198

Authors: F. Della Croce, Andrea Grosso 

Publication date: 15 October 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.07.011

Recommendations

• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
• Solution of large quadratic knapsack problems through aggressive reduction
• Some computational results on real 0-1 knapsack problems
• A Minimal Algorithm for the 0-1 Knapsack Problem

zbMATH Keywords

core problemreduction proceduretwo-constraint knapsack

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Local branching
• The multidimensional knapsack problem: structure and algorithms
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem

Cited In (3)

• A constraint generation approach for two-machine shop problems with jobs selection
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Special issue on knapsack problems and applications

This page was built for publication: Computational experience with a core-based reduction procedure for the 2-knapsack problem

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