Unverified50% confidenceFactExact time
The bin packing problem is NP-hard, and exhaustively enumerating all solutions becomes computationally infeasible as the scale grows
1
Sources
50%
Confidence
Long-term
Relevance
10/9/2026
First Seen
Sources
Related Entities
Related Claims
Unverified整数规划因引入离散变量而属于NP难问题，通常借助分支定界法求解77% similarUnverified整数规划（IP）因引入离散变量使解空间组合爆炸，属于NP难问题75% similarUnverifiedQAP has been proven to be NP-hard, and even instances of size n=30 can be intractable for exact solving algorithms.74% similarUnverifiedPCB布局（Placement）本质上是一个NP难的组合优化问题72% similarUnverifiedThe core difficulty of the Sokoban problem lies in the state space expanding exponentially as the number of boxes and map size increase.72% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/992672API
curl https://kongchang.com/api/v1/knowledge/claims/992672MCP
get_claim(id=992672)