A total-value greedy heuristic for the integer knapsack problem
type: Item
instance of: scholarly article
title: A total-value greedy heuristic for the integer knapsack problem
zbMATH Open document ID: 0757.90061
DOI: 10.1016/0167-6377(92)90065-B
author: Rajeev Kohli
author: Ramesh Krishnamurti
published in: Operations Research Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 95774
zbMATH Keywords: approximation algorithms
zbMATH Keywords: worst-case performance
zbMATH Keywords: greedy heuristic
zbMATH Keywords: integer knapsack
zbMATH Keywords: density-ordered greedy heuristic
MaRDI profile type: Publication
cites work: Worst-Case Analysis of Heuristic Algorithms
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Q4171868
cites work: When the Greedy Solution Solves a Class of Knapsack Problems
full work available at URL: 0167-6377(92)90065-b
OpenAlex ID: W1972327555
description: scientific article; zbMATH DE number 95774