CSpace
箱子是在线到达的带核元变尺寸装箱问题
帅天平1; 王海明2
2004
Source Publication应用数学学报
ISSN0254-3079
Volume027Issue:003Pages:423
Abstract本文考虑了一类箱子在线到达的带核元变尺寸装箱问题.假定箱子的尺寸可以是不同的.箱子是在线到达的,仅当箱子到达后其尺寸才知道.给定一个带有核元的物件表,目标是要将表中元素装入到达的箱子中,使得所用的箱子总长最小.我们首先证明了该问题是强NP—Hard,其次分析了经典算法NF(D)和FF(D)的性能界,指出NF(D)和FF(D)算法的性能界可以任意大.最后我们给出了相应的修改算法MNF(D)和MFF(D),证明了它们的性能界都是3,此界是紧的.
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/48741
Collection中国科学院数学与系统科学研究院
Affiliation1.中国科学院数学与系统科学研究院
2.兰州大学
Recommended Citation
GB/T 7714
帅天平,王海明. 箱子是在线到达的带核元变尺寸装箱问题[J]. 应用数学学报,2004,027(003):423.
APA 帅天平,&王海明.(2004).箱子是在线到达的带核元变尺寸装箱问题.应用数学学报,027(003),423.
MLA 帅天平,et al."箱子是在线到达的带核元变尺寸装箱问题".应用数学学报 027.003(2004):423.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[帅天平]'s Articles
[王海明]'s Articles
Baidu academic
Similar articles in Baidu academic
[帅天平]'s Articles
[王海明]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[帅天平]'s Articles
[王海明]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.