Dynamic Semantic Identification with Complexity Constraints as a Knapsack Problem.
Manolis FalelakisChristos DiouAnastasios ValsamidisAnastasios DelopoulosPublished in: FUZZ-IEEE (2005)
Keyphrases
- knapsack problem
- decision variables
- combinatorial optimization problems
- optimal solution
- dynamic programming
- optimization problems
- exact algorithms
- binary variables
- np hard
- test problems
- greedy algorithm
- semantic constraints
- integer variables
- bicriteria
- multidimensional knapsack problem
- heuristic solution
- computational complexity
- linear programming relaxation
- cutting plane
- greedy heuristic
- np hard problems
- linear relaxation
- implicit enumeration
- constraint programming
- continuous relaxation
- lp relaxation
- neural network
- linear constraints
- worst case
- constrained optimization
- approximation algorithms