Compressed data structures for bi-objective {0, 1}-knapsack problems.
Pedro CorreiaLuís PaqueteJosé Rui FigueiraPublished in: Comput. Oper. Res. (2018)
Keyphrases
- knapsack problem
- bi objective
- compressed data
- data compression
- combinatorial optimization problems
- multiple objectives
- dynamic programming
- optimization problems
- test problems
- optimal solution
- np hard
- compression ratio
- raw data
- greedy algorithm
- original data
- efficient solutions
- lossless compression
- compressed images
- data cube
- multi objective
- nsga ii
- shortest path problem
- data structure
- data sets
- main memory
- metaheuristic
- evolutionary algorithm
- computational complexity
- neural network