Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
type: Item
instance of: scholarly article
title: Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
zbMATH Open document ID: 1251.90279
author: Andrea Grosso
author: F. Della Croce
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6107438
zbMATH Keywords: multi-dimensional knapsack problem
zbMATH Keywords: core problem
zbMATH Keywords: partial enumeration
describes a project that uses: OR-Library
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.cor.2011.03.013
OpenAlex ID: W1984691021
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: A multi-level search strategy for the 0-1 multidimensional knapsack problem
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Local branching
cites work: The multidimensional 0-1 knapsack problem: an overview.
cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects
cites work: Improved convergent heuristics for the 0-1 multidimensional knapsack problem
cites work: Q4821303
cites work: A Computational Study of Search Strategies for Mixed Integer Programming
cites work: The multidimensional knapsack problem: structure and algorithms
cites work: Zero-one programming with many variables and few constraints
cites work: Improved results on the 0--1 multidimensional knapsack problem
cites work: Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
cites work: New convergent heuristics for 0-1 mixed integer programming
DOI: 10.1016/J.COR.2011.03.013
description: scientific article; zbMATH DE number 6107438