Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
type: Item
instance of: scholarly article
title: Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
zbMATH Open document ID: 1179.90282
published in: Computers \& Operations Research
publication date: 2008-12-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 5383142
zbMATH Keywords: multi-dimensional knapsack problem
zbMATH Keywords: heuristics
zbMATH Keywords: LP relaxation
author: Krzysztof Fleszar
author: Khalil S. Hindi
MaRDI profile type: Publication
full work available at URL: j.cor.2008.03.003
OpenAlex ID: W2015206115
cites work: An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
cites work: An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
cites work: Computationally manageable combinational auctions
cites work: Some integer programs arising in the design of main frame computers
cites work: The Theory and Computation of Knapsack Functions
cites work: The multidimensional 0-1 knapsack problem: an overview.
cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects
cites work: Exploiting nested inequalities and surrogate constraints
cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
cites work: Greedy algorithm for the general multidimensional knapsack problem
cites work: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
cites work: New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
cites work: A heuristic algorithm for the multidimensional zero-one knapsack problem
cites work: An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
cites work: Partial enumeration in heuristics for some combinatorial optimization problems
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Improved results on the 0--1 multidimensional knapsack problem
cites work: A heuristic solution procedure for the multiconstraint zero-one knapsack problem
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
DOI: 10.1016/J.COR.2008.03.003
Recommended article: Heuristics for the 0-1 multidimensional knapsack problem
Recommended article: An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
Recommended article: A heuristic algorithm for the multidimensional zero-one knapsack problem
Recommended article: Q4350066
Recommended article: Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
Recommended article: Improved convergent heuristics for the 0-1 multidimensional knapsack problem
Recommended article: Heuristic algorithms for the multiple-choice multidimensional knapsack problem
Recommended article: Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
Recommended article: Q2779608
Recommended article: A procedure-based heuristic for 0-1 multiple knapsack problems
description: scientific article; zbMATH DE number 5383142