RO EN
A generalization of the knapsack problem and finding the k-optimal tree in a weighted digraph. (English)
Authors: Lozovanu Dmitrii, Elena Tataru, Alex Zelikovsky
Abstract
We consider the packing knapsack problem which generalizes the classical knapsack problem. An algorithm of dynamical programming method for solving this problem and its application for finding the k-optimal tree in a weighted directed graph are proposed.Institute of Mathematics
and Computer Science
Academy of Science of Moldova
Academiei str, 5, MD-2028 Chisinau
Moldova
E-mail:
and Computer Science
Academy of Science of Moldova
Academiei str, 5, MD-2028 Chisinau
Moldova
E-mail:
Contents
- Some issues in the theory of supernilpotent radicals. (English)
- Rings and properties of lattices of I-radicals. (English)
- Completed commutative group rings without zero divisors. (English)
- Dual operators generated by parabolic boundary value problems. (English)
- Codimension-one bifurcations for a Rayleigh model. (English)
- On the problem of uniqueness of determination of an Archimedean polyhedron by its vertex star. (English)
- About associator nilpotence of finitely generated alternative algebras of characteristic 2 or 3. (English)
- About limiting distributions of the sums of intermixing random vectors with restricted variances. (English)
- A generalization of the knapsack problem and finding the k-optimal tree in a weighted digraph. (English)
- Academician Mitrofan Choban -- 60 Years. (English)
