The growth of m-constraint random knapsacks
type: Item
instance of: scholarly article
title: The growth of m-constraint random knapsacks
zbMATH Open document ID: 0708.90057
DOI: 10.1016/0377-2217(90)90303-S
author: K. Schilling
published in: European Journal of Operational Research
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 4164551
zbMATH Keywords: random knapsack
zbMATH Keywords: asymptotic value
MaRDI profile type: Publication
cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
cites work: On the growth of random knapsacks
full work available at URL: 0377-2217(90)90303-s
OpenAlex ID: W2024867790
Recommended article: The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
Recommended article: On the growth of random knapsacks
Recommended article: The growth of multi-constraint random knapsack with various right-hand sides of the constraints
Recommended article: Random knapsacks with many constraints
Recommended article: Q4377043
Recommended article: Q3494383
Recommended article: An algorithm of solving the m-dimensional knapsack problem with random coefficients
description: scientific article; zbMATH DE number 4164551