Joint performance of greedy heuristics for the integer knapsack problem

DOI10.1016/0166-218X(93)E0132-IzbMath0831.90090OpenAlexW2073388198MaRDI QIDQ1343153

Rajeev Kohli, Ramesh Krishnamurti

Publication date: 1 February 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)e0132-i

zbMATH Keywords

greedy algorithmworst caseinteger knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (3)

Unnamed Item ⋮ On the Proximity of the Optimal Values of the Multi-dimensional Knapsack Problem with and Without the Cardinality Constraint ⋮ A linear compound algorithm for uniform machine scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• A total-value greedy heuristic for the integer knapsack problem
• New Algorithms for Bin Packing
• Worst-Case Analysis of Heuristic Algorithms
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

This page was built for publication: Joint performance of greedy heuristics for the integer knapsack problem