ISSN 2587-814X (print),
ISSN 2587-8158 (online)

Russian version: ISSN 1998-0663 (print),
ISSN 2587-8166 (online)

Mikhail Ulyanov1,2, O. Naumova
  • 1 Lomonosov Moscow State University, 1, Leninskie Gory, Moscow 119991, Russia
  • 2 Trapeznikov Institute of Control Sciences, Russian Academy of Sciences , 65, Profsoyuznaya Street, Moscow 117997, Russia

2009. No. 2. P. 27–33 [issue contents]
The article is viewing basic exact solution algorithms for the problem of onedimensional optimum for the cost packing  recursive and table algorithms. Combined and wave algorithms are suggested since rational combination of basic algorithms allows them to have better resource characteristics. Differences in use and in the resource requirements of suggested algorithms are indicated.
Citation: Ul'yanov M. V., Naumova O. A. (2009) Kombinirovannyy i volnovoy algoritmy resheniya zadachi upakovki: printsipy postroeniya i osobennosti [] Biznes-informatika, 2, pp. 27-33 (in Russian)
Rambler's Top100 rss