An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem (Q1616250)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem |
scientific article; zbMATH DE number 6969967
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem |
scientific article; zbMATH DE number 6969967 |
Statements
An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem (English)
0 references
1 November 2018
0 references
lexicographic order
0 references
lexicographic maximum
0 references
multidimensional Boolean knapsack problem
0 references
lexicographic search algorithm
0 references
