A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
From MaRDI portal
Publication:1761954
DOI10.1016/j.cor.2011.01.019zbMath1251.90017WikidataQ59269948 ScholiaQ59269948MaRDI QIDQ1761954
Funda Samanlioglu, Xiaochun Jiang, Daniel Mota, Lauren B. Davis, Paul M. Stanfield
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.01.019
90C10: Integer programming
90C59: Approximation methods and heuristics in mathematical programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
The impact of false-negative reads on the performance of RFID-based shelf inventory control policies, A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- A hybrid random-key genetic algorithm for a symmetric travelling salesman problem
- Scatter search for the 0-1 multidimensional knapsack problem
- A unified method for a class of convex separable nonlinear knapsack problems
- Nonconvex piecewise linear knapsack problems
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Simple but efficient approaches for the collapsing knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Unbounded knapsack problem: Dynamic programming revisited
- The nonlinear knapsack problem - algorithms and applications
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
- Where are the hard knapsack problems?
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- Improving genetic algorithm convergence using problem structure and domain knowledge in multidimensional knapsack problems
- Radio frequency identification system optimisation models for lifecycle of a durable product
- The stochastic knapsack problem
- A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
- Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints.
