A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954)

scientific article

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

Statements

instance of

scholarly article

0 references

title

A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (English)

0 references

0 references

0 references

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

15 November 2012

0 references

zbMATH Keywords

RFID tags

0 references

data allocation

0 references

knapsack problem

0 references

describes a project that uses

Knapsack

0 references

MOTGA

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2011.01.019

0 references

cites work

Radio frequency identification system optimisation models for lifecycle of a durable product

0 references

The multidimensional 0-1 knapsack problem -- bounds and computational aspects

0 references

Scatter search for the 0-1 multidimensional knapsack problem

0 references

Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem

0 references

A multi-level search strategy for the 0-1 multidimensional knapsack problem

0 references

The multidimensional 0-1 knapsack problem: an overview.

0 references

A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems

0 references

Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls

0 references

Unbounded knapsack problem: Dynamic programming revisited

0 references

Nonconvex piecewise linear knapsack problems

0 references

Simple but efficient approaches for the collapsing knapsack problem

0 references

Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms

0 references

The stochastic knapsack problem

0 references

The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study

0 references

MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem

0 references

On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study

0 references

The nonlinear knapsack problem - algorithms and applications

0 references

Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints.

0 references

A unified method for a class of convex separable nonlinear knapsack problems

0 references

Q4546589

0 references

Q4079017

0 references

A hybrid random-key genetic algorithm for a symmetric travelling salesman problem

0 references

A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)

0 references

Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art

0 references

A genetic algorithm for the multidimensional knapsack problem

0 references

Improving genetic algorithm convergence using problem structure and domain knowledge in multidimensional knapsack problems

0 references

New trends in exact algorithms for the \(0-1\) knapsack problem

0 references

Where are the hard knapsack problems?

0 references

Identifiers

zbMATH Open document ID

1251.90017

0 references

DOI

10.1016/j.cor.2011.01.019

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1761954