The HEWC problem was formulated as an integer linear program, and an approximation solution was obtained by using LP-relation and rounding heuristic.
HEWC问题第一次被归结为一个整数线性规划问题，并且利用LP的放松问题和有界启发得到一个近似解。
The learning approach leads to a hard mixed integer program that can be solved iteratively in a heuristic optimization.
使用迭代的启发式最优化算法来解决多例学习中复杂的整型规划问题，以使分类风险最小化。
The learning approach leads to a hard mixed integer program that can be solved iteratively in a heuristic optimization.
使用迭代的启发式最优化算法来解决多例学习中复杂的整型规划问题，以使分类风险最小化。
应用推荐