Unverified50% confidenceFactExact time
拓扑优化起源于1988年Bendsøe和Kikuchi的论文，通过迭代算法在给定设计空间内寻找最优材料分布方案
1
Sources
50%
Confidence
Long-term
Relevance
8/19/2026
First Seen
Sources
Related Claims
Unverified进化算法自20世纪60年代起被用于解决复杂优化问题，由John Holland等人系统化63% similarVerifiedThe Hungarian algorithm was developed by Harold Kuhn in 1955 based on the work of Dénes Kőnig and Jenő Egerváry, has a time complexity of O(n³), and is used for optimal assignment in bipartite graphs.61% similarUnverifiedIsosurface extraction is based on the Marching Cubes algorithm, which was proposed by Lorensen and Cline in 1987.60% similarUnverified力导向布局的经典实现包括Fruchterman-Reingold算法（1991年）和Kamada-Kawai算法（1989年），朴素实现复杂度为O(n²)每次迭代60% similarUnverifiedThe SM-2 algorithm was developed by Polish researcher Piotr Woźniak in 1987; it dynamically adjusts the interval to the next review based on the user's self-assessed difficulty for each review session, and has been productized by tools such as Anki and SuperMemo.60% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/772649API
curl https://kongchang.com/api/v1/knowledge/claims/772649MCP
get_claim(id=772649)