Matroidal relaxations for 0-1 knapsack problems.

Lígia Amado Paulo Bárcia

Published in: Oper. Res. Lett. (1993)

Keyphrases

nsga ii
knapsack problem
linear programming relaxation
test problems
np hard
optimal solution
combinatorial optimization problems
optimization problems

lp relaxation
lower bound
dynamic programming
linear programming
exact algorithms
np hard problems
binary variables
production planning

bicriteria
evolutionary algorithm
cutting plane
integer programming
greedy algorithms
continuous relaxation
convex relaxation
semidefinite

neural network
maximum profit
greedy algorithm
branch and bound
metaheuristic
special case
reinforcement learning