Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions

DOI10.1134/S1064230710050102zbMath1276.90060MaRDI QIDQ357176

I. Kh. Sigal, Alexander Korbut

Publication date: 30 July 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

zbMATH Keywords

greedy solutionratio \(\delta\)

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (1)

Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem

Uses Software

• Knapsack

Cites Work

• The average behaviour of greedy algorithms for the knapsack problem: general distributions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions