Concept整数线性规划 / ILP
Integer Programming
A class of mathematical optimization problems in which some or all decision variables are required to take integer values. It is widely applied to combinatorial optimization settings such as scheduling, assignment and resource optimization.
Timeline (last 90 days)
Nov 6
Constrained optimization problems are usually NP-hard; as the number of talks increases, the computation required to exhaustively enumerate all scheduling options grows explosively, and practical systems mostly use heuristic algorithms or integer programming to find approximate optimal solutions.
Unverified50%