A STRATEGY OF FINDING MAXIMAL CUTTING PLANS
In this paper, we take into account the set of all cutting plans in a special cutting problem. Being given proper partial order, the set of all cutting plans forms an ideal of a chain-product. We get a strategy of finding maximal cutting plans by Boundary algorithm, which proposes a general method of finding all maximal elements of an ideal. In this paper, we do not care about the process of getting cutting plans, but which cutting plan is maximal and the strategy of how to find the maximum.
Cutting Plan Algorithm Optimization
BAOQING JIANG RUI LI JITAO ZHAO
Institute of Data and Knowledge Engineering, Henan University, Kaifeng 475001, China College of Mathematics and Information Science, Henan University, Kaifeng 475001, China
国际会议
开封
英文
490-493
2006-10-15（万方平台首次上网日期，不代表论文的发表时间）