Methods to develop a solution to the modified knapsack problem for purposes of information support of the Honorarium automated system

Autor:	K. O. Malinina
Rok vydání:	2008
Předmět:	Mathematical optimization Counting problem Cutting stock problem Knapsack problem Continuous knapsack problem Change-making problem Computational problem General Economics Econometrics and Finance Function problem Generalized assignment problem Mathematics
Zdroj:	Automatic Documentation and Mathematical Linguistics. 42:239-247
ISSN:	1934-8371 0005-1055
DOI:	10.3103/s0005105508050014
Popis:	When developing information support for the Honorarium automated system, one of the problems involving mathematical methods was the problem of forming a so-called payroll register. This problem is classified as an NP-complete problem. The factorization of this problem enabled us to consider it as a particular case of the knapsack problem. Two methods of solution were proposed regarding the peculiarities of the problem. The computational complexity for all of these is estimated, the scope is indicated, and features of the development are described.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::682e77bbc9cd7d010e2d315e5550ea5a https://doi.org/10.3103/s0005105508050014 Zobrazit plný text záznamu Full text from SpringerLink