Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
indicator variables. One workaround is to constrain the indicator variables between 0 and 1 and then when value is < 0.5 we can consider 0 else 1. But this is not optimal and could be way off than the true optimal value. References Minimum-cost flow — Algorithms for Competitive Programming