Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem.
Soh KumabeTakanori MaeharaRyoma Sin'yaPublished in: CoRR (2018)
Keyphrases
- knapsack problem
- optimal solution
- dynamic programming
- learning algorithm
- np hard
- tree structure
- implicit enumeration
- exact algorithms
- test problems
- objective function
- finite state automata
- cost function
- combinatorial optimization problems
- simulated annealing
- optimization problems
- bicriteria
- worst case
- computational complexity
- metaheuristic
- particle swarm optimization
- evolutionary algorithm
- linear space
- greedy heuristic
- lower bound
- bayesian networks