On Lagrangian Relaxation and Subset Selection Problems.

Ariel Kulik Hadas Shachnai

Published in: WAOA (2008)

Keyphrases

subset selection
lagrangian relaxation
linear programming
dual decomposition
dynamic programming
np complete
feasible solution
hill climbing
lower bound
special case
convex optimization
column generation
mixed integer programming
network design problem
mixed integer program