Unverified50% confidenceFactExact time
The branch-and-bound algorithm was first proposed by A.H. Land and A.G. Doig in 1960, originally used to solve integer linear programming problems.
1
Sources
50%
Confidence
Long-term
Relevance
8/31/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe theoretical foundations of interval arithmetic can be traced back to the pioneering work of Ramon Moore in the 1960s, and the IEEE 1788-2015 standard formalizes its implementation.61% similarUnverified线性规划由丹齐格于1947年提出59% similarUnverified增量计算的核心思想源自自适应计算研究，最早由卡内基梅隆大学的 Umut Acar 等人在 2000 年代初系统化提出57% similarUnverifiedCartPole问题最早可追溯到1960年代的控制理论研究，是验证控制算法稳定性的经典测试平台57% similarUnverifiedGeorge Dantzig invented the Simplex Method in 1947.56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/832497API
curl https://kongchang.com/api/v1/knowledge/claims/832497MCP
get_claim(id=832497)