A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954)
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: A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) |
scientific article; zbMATH DE number 6107446
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) |
scientific article; zbMATH DE number 6107446 |
Statements
A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (English)
0 references
15 November 2012
0 references
RFID tags
0 references
data allocation
0 references
knapsack problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
