Unverified50% confidenceFactExact time
Mixed integer programming (MIP) is a class of optimization problems in which some decision variables are constrained to be integers (or 0-1 variables), and the goal is to minimize or maximize a linear objective function subject to linear constraints.
1
Sources
50%
Confidence
Long-term
Relevance
11/3/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedLinear programming relaxation is a standard bound-estimation technique in combinatorial optimization: after relaxing integer variables to continuous variables, the problem becomes a linear program solvable in polynomial time, and its optimal value gives an upper bound on the optimal value of the original integer problem (for maximization problems).72% similarUnverifiedSemidefinite programming is a convex optimization problem that constrains decision variables to be positive semidefinite matrices; it is a convex problem solvable in polynomial time and yields a globally optimal solution.72% similarUnverified优化模型的结构包括一个需要最大化或最小化的目标函数，外加一组需要遵守的约束条件67% similarUnverifiedHybrid reasoning is essentially adaptive allocation of inference-time compute, consistent with the conclusion of "compute-optimal allocation" in test-time scaling research.66% similarVerified混合专家架构MoE通过稀疏激活机制，推理时只激活模型总参数的1/8至1/465% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1129440API
curl https://kongchang.com/api/v1/knowledge/claims/1129440MCP
get_claim(id=1129440)