THE one-dimensional bin-packing problem is defined as follows: for a given list L={p<sub>1</sub>, p<sub>2</sub>,…, P<sub>n</sub>}, where 0【p<sub>i</sub>≤1 denotes the...THE one-dimensional bin-packing problem is defined as follows: for a given list L={p<sub>1</sub>, p<sub>2</sub>,…, P<sub>n</sub>}, where 0【p<sub>i</sub>≤1 denotes the item and its size as well, we are to pack all the items in-to bins, each of which has a capacity 1, and the goal is to minimize the number of bins used.The first-fit-decreasing （FFD） algorithm is a famous approximate algorithm for the bin-pack-ing problem. The FFD algorithm first sorts all the list into non-increasing order and then pro-cesses the pieces in that order by placing each item into the first bin into which it fits.展开更多
基金河南省2013年博士后项目基金"基于语料库的汉英概称句对比与翻译研究"(2013030)的阶段性成果西北农林科技大学科研处项目"波兰尼的默会认识论与翻译研究"(项目编号:2011RWZX07)+1 种基金西北农林科技大学基本科研业务费--人文社科项目"英汉词汇衔接对比与翻译研究"(2014RW Y B21)陕西师范大学中央高校基本科研业务费专项资金项目"基于语料库的英汉动量构式对比与翻译研究"(14SZYB27)的资助
文摘THE one-dimensional bin-packing problem is defined as follows: for a given list L={p<sub>1</sub>, p<sub>2</sub>,…, P<sub>n</sub>}, where 0【p<sub>i</sub>≤1 denotes the item and its size as well, we are to pack all the items in-to bins, each of which has a capacity 1, and the goal is to minimize the number of bins used.The first-fit-decreasing （FFD） algorithm is a famous approximate algorithm for the bin-pack-ing problem. The FFD algorithm first sorts all the list into non-increasing order and then pro-cesses the pieces in that order by placing each item into the first bin into which it fits.
