An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional boolean knapsack problem
Saved in:
| Date: | 2018 |
|---|---|
| Main Author: | S. V. Chupov |
| Format: | Article |
| Language: | English |
| Published: |
2018
|
| Series: | Cybernetics and Systems Analysis |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000889045 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
The approximate algorithm of parallel lexicographical search for the multidimensional boolean knapsack problem with a fixed ordering of variables
by: S. V. Chupov
Published: (2017) -
Structural and stochastic properties of the lexicographic search algorithm for solution of a discrete optimization problem
by: S. V. Chupov
Published: (2016) -
Efficient algorithms for lexicographical minimum of a set searching
by: S. V. Chupov
Published: (2015) -
Lexicographically ordered permutations
by: S. V. Chupov
Published: (2016) -
Higher-order quantum genetic algorithm for 0–1 knapsack problem
by: V. M. Tkachuk, et al.
Published: (2018)