Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem

DOI10.1016/j.cor.2011.03.013zbMath1251.90279OpenAlexW1984691021MaRDI QIDQ1761940

Andrea Grosso, Frederico Della Croce

Publication date: 15 November 2012

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

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

zbMATH Keywords

core problempartial enumerationmulti-dimensional knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (9)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Robust efficiency measures for linear knapsack problem variants ⋮ Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities ⋮ Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem ⋮ A new exact approach for the 0-1 collapsing knapsack problem ⋮ Improved LP-based algorithms for the closest string problem ⋮ Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ Revisiting surrogate relaxation for the multidimensional knapsack problem

Uses Software

• OR-Library
• Knapsack

Cites Work

• Unnamed Item
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• Zero-one programming with many variables and few constraints
• A genetic algorithm for the multidimensional knapsack problem
• Local branching
• The multidimensional 0-1 knapsack problem: an overview.
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Improved results on the 0--1 multidimensional knapsack problem
• New convergent heuristics for 0-1 mixed integer programming
• Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
• The Multidimensional Knapsack Problem: Structure and Algorithms
• An Algorithm for Large Zero-One Knapsack Problems
• A Computational Study of Search Strategies for Mixed Integer Programming

This page was built for publication: Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem