For very general single location on a closed convexdomain, propose a combining algorithm which has global convergence.
针对一般具闭凸集约束的单址选址模型,提出具全局收敛性的组合算法。
2
Polishing tool paths were constructed to evenly cover a 3-d free-form surface defined within a 2-d convexdomain to reduce surface roughness and improve efficiency.
Ren Delin had extended it to long needle problem, who cancelled the limitation (the diameter of the convexdomain is less than the distance of the grid of parallel lines).