Unverified50% confidenceFactExact time
Multi-Agent Pathfinding (MAPF) has been proven to be an NP-hard problem.
1
Sources
50%
Confidence
Long-term
Relevance
9/11/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedPCB布局（Placement）本质上是一个NP难的组合优化问题68% similarUnverified整数规划因引入离散变量而属于NP难问题，通常借助分支定界法求解67% similarUnverified整数规划（IP）因引入离散变量使解空间组合爆炸，属于NP难问题66% similarUnverifiedPure routing approaches have limitations: the router itself can make mistakes, and cross-domain questions still require broad retrieval.65% similarUnverifiedThe cold-chain logistics optimization problem is essentially a variant of the Vehicle Routing Problem (VRP) with multiple constraints, and finding an exact solution is generally NP-hard computationally.64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/892881API
curl https://kongchang.com/api/v1/knowledge/claims/892881MCP
get_claim(id=892881)