An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint.

Kenjiro Takazawa

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

Keyphrases

learning algorithm
objective function
convex functions
optimal solution
worst case
computational complexity
dynamic programming
piecewise linear
primal dual
np hard
expectation maximization
dc programming
reinforcement learning
decision theoretic