Multi-constrained matroidal knapsack problems.
Paolo M. CameriniFrancesco MaffioliCarlo VercellisPublished in: Math. Program. (1989)
Keyphrases
- exact algorithms
- knapsack problem
- combinatorial optimization problems
- test problems
- optimal solution
- np hard
- dynamic programming
- optimization problems
- linear programming relaxation
- production planning
- maximum profit
- np hard problems
- greedy algorithm
- cutting plane
- bicriteria
- continuous relaxation
- metaheuristic
- implicit enumeration
- evolutionary algorithm