DESIGN AND EXAMINATION OF ALGORITHMS FOR SOLVING THE KNAPSACK PROBLEM

DESIGN AND EXAMINATION OF ALGORITHMS FOR SOLVING THE KNAPSACK PROBLEM

The use of methods of branches and boundaries as well as the methods of dynamic programming at solving the problem of «knapsack» is grounded. The main concepts are expounded. The methods and algorithms development for solving the above specified problem are described. Recommendations on practical ap...

Full description

Bibliographic Details
Main Authors: S. Kantsedal, M. Kostikova, I. Skrypina
Format: Article
Language:English
Published: Kharkiv National Automobile and Highway University 2015-07-01
Series:Avtomobilʹnyj Transport (Harʹkov)
Subjects:
knapsack problem
algorithm
dynamic programming
branch and bound
strategy
Online Access:http://dspace.khadi.kharkov.ua/dspace/bitstream/123456789/1099/1/%D0%90%D0%A2_36_24.pdf

Similar Items

Similar Items