首页>
外国专利>
Priority-based search for combinatorial optimization problems
Priority-based search for combinatorial optimization problems
展开▼
机译:基于优先级的组合优化问题搜索
展开▼
页面导航
摘要
著录项
相似文献
摘要
A method solves a combinatorial optimization problem including multiple elements and values. An ordering function is applied to an instance of the combinatorial optimization problem to produce an ordering of elements. The ordering of the elements is modified repeatedly to produce a re-ordering of the elements. A placement function is applied to each re-ordering of the elements to obtain solutions of the combinatorial optimization problem, until a termination condition is reached, and a best solution is selected.
展开▼