an algorithm for set cover problem

an algorithm for set cover problem

ID:40352274

大小:763.22 KB

页数:9页

时间:2019-07-31

an algorithm for set cover problem _第1页
an algorithm for set cover problem _第2页
an algorithm for set cover problem _第3页
an algorithm for set cover problem _第4页
an algorithm for set cover problem _第5页
资源描述:

《an algorithm for set cover problem 》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、EuropeanJournalofOperationalResearch31(1987)85-93North-HollandAnalgorithmforsetcoveringproblemJ.E.BEASLEYDepartmentofManagementScience,ImperialCollege,LondonSW72BX,EnglandAbstract:Inthispaperwepresentanalgorithmforthesetcoveringproblemthatcombinesproblemreducti

2、ontestswithdualascent,subgradientoptimisationandlinearprogramming.Computationalresultsarepresentedforproblemsinvolvingupto400rowsand4000columns.Keywords:Setcovering,optimisation1.Introductionfieldssuchasairlinecrewscheduling[1,13,14],locationofemergencyfaciliti

3、es[16,19],routingInthispaperweconsiderthesetcoveringprob-problems[ll],assemblylinebalancing[17]andlem(SCP)whichistheproblemofcoveringtheinformationretrieval[7].Otherapplicationareasrowsofam-row,n-column,zero-onematrix(aij)aregivenin[4].byasubsetofthecolumnsatmi

4、nimumcost.ChristofidesandKorman[6]presentedacom-Formallytheproblemcanbedefinedasfollows:putationalsurveyofanumberofdifferentmeth-LetodsfortheSCPandreportedthesolutionofunicost(cj=1,j=1,...,n)problemsinvolvingxj=1ifcolumnj(costcj)isinthesolution,upto35rowsand107

5、5columns(density20%).=0otherwise,NoteherethatthedensityofaSCPistheper-centageofonesinthe(aij)matrix.thentheprogramisEtcheberry[8]presentedanalgorithmbaseduponlagrangeanrelaxationofasubsetoftheminimise,~~CjXj)coveringconstraints(equation(2))withsubgradi-entoptim

6、isationbeingusedtodecidethelagrangesubjectto,$raijXj>,1,i=1,...,m,(2)multipliers.Hereportedthesolutionofunicostproblemsinvolvingupto50rowsand100col-umns(densitiesfrom6%to.25%).xjE(O>l>>j=l,**-,n.(3)Paixao[15]presentedanalgorithmbaseduponEquation(2)ensuresthatea

7、chrowiscoveredbydecompositionandstatespacerelaxationandre-atleastonecolumnandequation(3)isthein-portedthesolutionofproblemsinvolvingup’totegralityconstraint.Iftheinequalitiesinequation400rowsand4000columns(density2%).(2)arereplacedbyequalitiestheresultingprob-B

8、alasandHo[3]reportedthatareasonablelemiscalledthesetpartitioningproblem(SPP).lowerboundfortheSCPcouldbefoundbyadualBoththeSCPandtheSPParewell-knownascentproceduretogetherwit

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。