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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kharkiv National Automobile and Highway University
2015-07-01
|
| Series: | Avtomobilʹnyj Transport (Harʹkov) |
| Subjects: | |
| Online Access: | http://dspace.khadi.kharkov.ua/dspace/bitstream/123456789/1099/1/%D0%90%D0%A2_36_24.pdf |