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

DOI10.1016/j.cor.2010.07.011zbMath1231.90321OpenAlexW1995896424MaRDI QIDQ709198

Frederico 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

zbMATH Keywords

reduction procedurecore problemtwo-constraint knapsack

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

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

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