The Generating Functions in the Knapsack Problem

 
PIIS086956520002139-5-1
DOI10.31857/S086956520002139-5
Publication type Article
Status Published
Authors
Affiliation: Dorodnicyn Computing Centre, RAS
Affiliation: Bauman Moscow State Technical University
Journal nameDoklady Akademii nauk
EditionVolume 481 Issue 5
Pages478-480
Abstract

  

Keywords
Received30.10.2018
Publication date30.10.2018
Cite   Download pdf To download PDF you should sign in
Размещенный ниже текст является ознакомительной версией и может не соответствовать печатной

views: 1252

Readers community rating: votes 0

1. Leont'ev V. K. Proizvodyaschie funktsii v zadache o rantse. V sb.: Materialy XI Mezhdunarodnogo seminara “Diskretnaya matematika i ee prilozheniya”. M.: MGU, 2012. S. 415–416.

2. Leont'ev V. K. Kombinatorika i informatsiya. Ch. 1. Kombinatornyj analiz. M.: MFTI, 2015. 174 s.

3. Egorychev G. P. Integral'noe predstavlenie i vychislenie kombinatornykh summ. Novosibirsk: Nauka, 1977.

4. Kellerer H., Pferschy U., Pisinger D. Knapsack Problems. B.: Springer, 2004.

5. Dyubin G. N., Korbut A. A. Povedenie v srednem zhadnykh algoritmov dlya minimizatsionnoj zadachi o rantse — obschie raspredeleniya koehffitsientov // ZhVMiMF. 2008. T. 48. № 9. S. 1556–1570.

Система Orphus

Loading...
Up