CSpace  > 应用数学研究所
一类带多重核元集在线装箱问题
帅天平; 胡晓东
2005
Source Publication应用数学
ISSN1001-9847
Volume018Issue:003Pages:411
Abstract本文讨论了一类在线变尺寸装箱问题,假定箱子的尺寸可以是不同的.箱子是在线到达的,仅当箱子到达后其尺寸才知道.给定一个带有核元的物品表及其上的核元关系图.我们的目标是要将表中元素装入到达的箱子中,保证任何箱子所装物品不互为核元,即所装物品对应的点所导出的子图是个空图,并使得所用的箱子总长最小.我们证明了该问题是NP-Hard的,并给出了基于图的点染色、图的团分解和基于背包问题的近似算法,给出了算法的时间复杂度和性能界.
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/38121
Collection应用数学研究所
Affiliation中国科学院数学与系统科学研究院
Recommended Citation
GB/T 7714
帅天平,胡晓东. 一类带多重核元集在线装箱问题[J]. 应用数学,2005,018(003):411.
APA 帅天平,&胡晓东.(2005).一类带多重核元集在线装箱问题.应用数学,018(003),411.
MLA 帅天平,et al."一类带多重核元集在线装箱问题".应用数学 018.003(2005):411.
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.