A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
type: Item
instance of: scholarly article
title: A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
zbMATH Open document ID: 1251.90017
author: Funda Samanlioglu
author: Xiaochun Jiang
author: Daniel Mota
author: Lauren B. Davis
author: Paul M. Stanfield
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6107446
zbMATH Keywords: RFID tags
zbMATH Keywords: data allocation
zbMATH Keywords: knapsack problem
describes a project that uses: Knapsack
describes a project that uses: MOTGA
MaRDI profile type: Publication
full work available at URL: j.cor.2011.01.019
OpenAlex ID: W2064818653
Wikidata QID: Q59269948
cites work: Radio frequency identification system optimisation models for lifecycle of a durable product
cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects
cites work: Scatter search for the 0-1 multidimensional knapsack problem
cites work: Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
cites work: A multi-level search strategy for the 0-1 multidimensional knapsack problem
cites work: The multidimensional 0-1 knapsack problem: an overview.
cites work: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
cites work: Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
cites work: Unbounded knapsack problem: Dynamic programming revisited
cites work: Nonconvex piecewise linear knapsack problems
cites work: Simple but efficient approaches for the collapsing knapsack problem
cites work: Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms
cites work: The stochastic knapsack problem
cites work: The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study
cites work: MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
cites work: On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
cites work: The nonlinear knapsack problem - algorithms and applications
cites work: Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints.
cites work: A unified method for a class of convex separable nonlinear knapsack problems
cites work: Q4546589
cites work: Q4079017
cites work: A hybrid random-key genetic algorithm for a symmetric travelling salesman problem
cites work: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Improving genetic algorithm convergence using problem structure and domain knowledge in multidimensional knapsack problems
cites work: New trends in exact algorithms for the \(0-1\) knapsack problem
cites work: Where are the hard knapsack problems?
DOI: 10.1016/J.COR.2011.01.019
description: scientific article; zbMATH DE number 6107446