Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation
type: Item
instance of: scholarly article
title: Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation
zbMATH Open document ID: 1198.49005
DOI: 10.1134/S1064230709060070
author: N. N. Galim'yanova
author: I. Kh. Sigal
author: A. A. Korbut
published in: Journal of Computer and Systems Sciences International
publication date: 2010-09-24T00:00:00Z
Mathematics Subject Classification ID: 49J10
Mathematics Subject Classification ID: 49M30
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5790920
zbMATH Keywords: linear and integer knapsack problems
zbMATH Keywords: one-dimensional and multi-dimensional knapsack problems with Boolean variables
zbMATH Keywords: asymptotic behavior
describes a project that uses: Knapsack
MaRDI profile type: MaRDI publication profile
cites work: Greedy algorithms for the minimization knapsack problem: average behavior
cites work: Q4198056
cites work: The average behaviour of greedy algorithms for the knapsack problem: general distributions
full work available at URL: s1064230709060070
OpenAlex ID: W2000233350
Recommended article: Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions
Recommended article: On the approximation of an optimal solution to the integer knapsack problem by optimal solutions to the integer knapsack problem with a restriction on the cardinality
Recommended article: On combinatorial properties of the knapsack problem
Recommended article: Q3792481
Recommended article: Ratio combinatorial programs
description: scientific article; zbMATH DE number 5790920