Montecarlo Approach For Solving Unbound Knapsack Problem.
Vani Suthamathi SaravanarajanRung-Ching ChenChristine DewiLong-Sheng ChenPublished in: MISNC/IEMT (2020)
Keyphrases
- knapsack problem
- randomly generated test instances
- implicit enumeration
- combinatorial optimization problems
- test problems
- optimal solution
- optimization problems
- dynamic programming
- linear relaxation
- np hard
- np hard problems
- multidimensional knapsack problem
- greedy algorithm
- lp relaxation
- integer variables
- exact algorithms
- bicriteria
- multiple objectives
- linear programming relaxation
- combinatorial optimization
- decision variables
- heuristic solution
- exact solution
- linear programming problems
- quadratic programming
- neural network
- traveling salesman problem
- linear program
- multi objective
- objective function