5integer_programming

5integer_programming

ID:40022461

大小:59.00 KB

页数:3页

时间:2019-07-17

5integer_programming_第1页
5integer_programming_第2页
5integer_programming_第3页
资源描述:

《5integer_programming》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、TelAvivUniversity,Fall2004Lecture5Lecturer:OdedRegevLatticesinComputerScienceIntegerProgrammingScribe:IshayHavivInthislecturewepresentanotherapplicationoftheLLLalgorithm,namely,integerprogramminginfixeddimension.1IntegerProgrammingOverviewTheIntegerProgrammingproblem(IP)isthatofdecidingwhetherthe

2、reexistsanintegersolutiontoagivensetofmrationalinequalitiesonnvariables.Equivalently,givenamatrixA2Qm£nandb2Qm,decideifthereisaz2ZnsuchthatAz·b.Yetanotherequivalentformulationis:givenamatrixA2Qm£ndecidewhetherthesetZnfx2RnjAx·bgisnon-empty.Theintegerprogrammingproblemisquitepowerful,andmanycomb

3、inatorialproblemscanbeformulatedasinstancesofIP.Infact,itis‘toopowerful’sinceitisNP-complete,asthefollowingclaimshows.REMARK1Withouttherequirementonanintegersolution(i.e.,ifweallowz2Rn),theproblemisknownasLinearProgramming,andhasapolynomialtimesolution(suchastheellipsoidmethod).REMARK2Therearema

4、nyequivalentformulationsofintegerprogramming.Wecould,forinstance,allowequalitiesinadditiontoinequalities.Moreover,wecouldasktofindanintegersolutionandnotjustdecideifoneexists.CLAIM1TheintegerprogrammingproblemisNP-complete.PROOF:IPisinNPbecausetheintegersolutioncanbeusedasawitnessandcanbeverifiedi

5、npolynomialtime.1WenowprovethatIPisNP-hardbyreductionfromSAT.ASATinstanceisdescribedbyasetofBooleanvariablesandclauses.WereduceittoanIntegerProgramminginstancewiththesamenumberofvariables.Inaddition,foreachvariableviwehavetheconstraints0·vi·1:Foreachclausewehaveaconstraintthatcorrespondtoit;fore

6、xample,fortheclausev1_v3_v7intheSATinstance,wehavetheconstraintv1+(1¡v3)+v7¸1:Clearly,thisreductioncanbedoneinpolynomialtime.Moreover,itiseasytoverifythatifthegivenSATinstancehasasatisfyingassignmentthenthecorrespondingIPinstancehasanintegersolutionandviceversa.2AlthoughitisNP-complete,onemighth

7、opetoobtainefficientalgorithmsforthecasewherethedi-mension(i.e.,thenumberofvariables)isfixed.Forn=1,itiseasytocomeupwithanefficientsolution.However,evenforn=2,thisisnolongerobvious.Inthenextsection,wedescribethecelebratedalgori

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

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

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