Login / Signup
Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems.
Santiago Valdés Ravelo
Cláudio N. Meneses
Published in:
Comput. Oper. Res. (2021)
Keyphrases
</>
dynamic programming
lagrangian relaxation
small number
linear programming
np complete
lower and upper bounds
heuristic methods
branch and bound procedure
learning algorithm
mixed integer program
partial solutions
feasible solution
optimal policy
optimization problems
state space
lower bound
reinforcement learning