Computational experience with a core-based reduction procedure for the 2-knapsack problem
From MaRDI portal
Publication:709198
DOI10.1016/j.cor.2010.07.011zbMath1231.90321MaRDI 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
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
A constraint generation approach for two-machine shop problems with jobs selection, Special issue on knapsack problems and applications, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
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