Combinatorial Optimization

Combinatorial Optimization

ID:40600575

大小:145.22 KB

页数:34页

时间:2019-08-04

Combinatorial Optimization_第1页
Combinatorial Optimization_第2页
Combinatorial Optimization_第3页
Combinatorial Optimization_第4页
Combinatorial Optimization_第5页
资源描述:

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

1、AlexanderSchrijverCombinatorialOptimizationPolyhedraandEciencySeptember1,2002SpringerBerlinHeidelbergNewYorkBarcelonaHongKongLondonMilanParisTokyoPrefaceThebookbyGeneLawlerfrom1976wasthe rstofaseriesofbooksallen-titled`CombinatorialOptimization',someembellishedwithasubtitle

2、:`Net-worksandMatroids',`AlgorithmsandComplexity',`TheoryandAlgorithms'.Whyaddinganotherbooktothisillustriousseries?Thejusti cationiscon-tainedinthesubtitleofthepresentbook,`PolyhedraandEciency'.ThisisshorthandforPolyhedralCombinatoricsandEcientAlgorithms.Pioneeredbythewor

3、kofJackEdmonds,polyhedralcombinatoricshasprovedtobeamostpowerful,coherent,andunifyingtoolthroughoutcom-binatorialoptimization.Notonlyithasledtoecient(thatis,polynomial-time)algorithms,butalso,conversely,ecientalgorithmsoftenimplypoly-hedralcharacterizationsandrelatedmin-ma

4、xrelations.Itmakesthetwosidescloselyintertwined.Weaimato eringbothanintroductiontoandanin-depthsurveyofpoly-hedralcombinatoricsandecientalgorithms.Withinthespanofpolyhedralmethods,wetrytopresentabroadpictureofpolynomial-timesolvablecom-binatorialoptimizationproblems

5、morepre

6、cisely,ofthoseproblemsthathavebeenprovedtobepolynomial-timesolvable.Nexttothat,wegointoafewprominentNP-completeproblemswherepolyhedralmethodsweresuc-cesfulinobtaininggoodboundsandapproximations,likethestablesetandthetravelingsalesmanproblem.Nevertheless,whileweobviouslyhopet

7、hatthequestionNP=P?"willbesettledsoononewayortheother,werealizethatintheastonishingeventthatNP=Pwillbeproved,thisbookwillbehighlyincomplete.Byde nition,beinginPmeansbeingsolvablebya`deterministicse-quentialpolynomial-time'algorithm,andinourdiscussionsofalgorithmsandcomplexi

8、tywerestrictourselvesmainlytothischaracteristic.Asaconse-quence,wedonotcover(butyetoccasionallytouchoroutline)theimportantworkonapproximative,randomized,andparallelalgorithmsandcomplex-ity,areasthatarerecentlyinexcitingmotion.Wealsoneglectapplications,modelling,andcomputatio

9、nalmethodsforNP-completeproblems.Advanceddatastructuresaretreatedonlymodera

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

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

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