A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
type: Item
instance of: scholarly article
title: A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
zbMATH Open document ID: 1147.65045
author: S. Raja Balachandar
author: K. Kannan
published in: Applied Mathematics and Computation
publication date: 2008-09-01T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5318696
zbMATH Keywords: 0-1 multi-constrained knapsack problem
zbMATH Keywords: heuristic
zbMATH Keywords: computational complexity
zbMATH Keywords: NP-hard problems
zbMATH Keywords: numerical examples
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.amc.2007.10.045
OpenAlex ID: W1968802784
cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: An Enumeration Algorithm for Knapsack Problems
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: A simulated annealing approach to the multiconstraint zero-one knapsack problem
cites work: Q4198056
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: The Theory and Computation of Knapsack Functions
cites work: Q4350063
cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem
cites work: A heuristic algorithm for the multidimensional zero-one knapsack problem
cites work: Q3993418
cites work: A heuristic solution procedure for the multiconstraint zero-one knapsack problem
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
DOI: 10.1016/J.AMC.2007.10.045
description: scientific article; zbMATH DE number 5318696