Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem.
Soh KumabeTakanori MaeharaRyoma Sin'yaPublished in: WALCOM (2019)
Keyphrases
- knapsack problem
- test problems
- optimal solution
- learning algorithm
- tree structure
- dynamic programming
- cost function
- np hard
- search space
- objective function
- combinatorial optimization problems
- simulated annealing
- linear programming
- optimization problems
- np hard problems
- linear program
- combinatorial optimization
- multi objective
- primal dual
- exact algorithms
- greedy heuristic
- bicriteria