An algorithm for solving a class of knapsack problems and its generalization

Balan Elena

Conţinutul numărului revistei

Articolul precedent

Articolul urmator

693

Ultima descărcare din IBN:
2017-08-25 11:48

SM ISO690:2012

BALAN, Elena. An algorithm for solving a class of knapsack problems and its generalization. In: Computer Science Journal of Moldova, 2004, nr. 3(36), pp. 364-370. ISSN 1561-4042.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Computer Science Journal of Moldova

Numărul 3(36) / 2004 / ISSN 1561-4042 /ISSNe 2587-4330

An algorithm for solving a class of knapsack problems and its generalization

Pag. 364-370

Balan Elena

Institute of Mathematics and Computer Science ASM

Proiecte:

INTAS Optimisation of Tartaric acid and enonotanines extraction from winery wastes and their utilization for the synthesis of new compounds with biological activity and antioxidant properties

Disponibil în IBN: 4 iulie 2017

Descarcă PDF

Rezumat

A class of knapsack problems which generalizes the classical ones is studied. Algorithms based on the dynamical programming and Branch and Bound methods are proposed. The correctness and time estimation of the algorithm are given.