Handbook of Combinatorial Optimization PDF
Preview Handbook of Combinatorial Optimization
Panos M. Pardalos Ding-Zhu Du Ronald L. Graham Editors Handbook of Combinatorial Optimization Second Edition 1 3 Reference Handbook of Combinatorial Optimization Panos M. Pardalos • Ding-Zhu Du Ronald L. Graham Editors Handbook of Combinatorial Optimization Second Edition With683Figuresand171Tables Editors PanosM.Pardalos RonaldL.Graham DepartmentofIndustrialand DepartmentofComputerScienceand SystemsEngineering Engineering UniversityofFlorida UniversityofCalifornia,SanDiego Gainesville,FL,USA LaJolla,CA,USA Ding-ZhuDu DepartmentofComputerScience TheUniversityofTexasatDallas Richardson,TX,USA ISBN978-1-4419-7996-4 ISBN978-1-4419-7997-1(eBook) ISBNBundle978-1-4614-3975-2 (printandelectronicbundle) DOI10.1007/978-1-4419-7997-1 SpringerNewYorkHeidelbergDordrechtLondon LibraryofCongressControlNumber:2013942873 1st edition: © Springer Science+Business Media New York 1999 (Volumes 1–3 and Supplement VolumeA),2005(SupplementVolumeB) 2ndedition:©SpringerScience+BusinessMediaNewYork2013 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartof thematerialisconcerned,specificallytherightsoftranslation,reprinting,reuseofillustrations,recitation, broadcasting,reproductiononmicrofilmsorinanyotherphysicalway,andtransmissionorinformation storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodology nowknownorhereafterdeveloped.Exemptedfromthislegalreservationarebriefexcerptsinconnection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’slocation,initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer. PermissionsforusemaybeobtainedthroughRightsLinkattheCopyrightClearanceCenter.Violations areliabletoprosecutionundertherespectiveCopyrightLaw. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. While the advice and information in this book are believed to be true and accurate at the date of publication,neithertheauthorsnortheeditorsnorthepublishercanacceptanylegalresponsibilityfor anyerrorsoromissionsthatmaybemade.Thepublishermakesnowarranty,expressorimplied,with respecttothematerialcontainedherein. Printedonacid-freepaper SpringerispartofSpringerScience+BusinessMedia(www.springer.com) Preface Many practical applications that include machines, people, or different resources thatareindivisible,giverisetooptimizationmodelswithdiscretedecisionvariables. On the otherhand,nonconvexities(e.g.,complementarity)in optimizationmodels canbeformulatedusingdiscretevariables. Inpastyears,wewitnessedseveraldevelopmentsincombinatorialoptimization. Thesedevelopmentscamealongwithprogressinrelatedfieldssuchascomplexity theory, approximation algorithms, as well as with advances in software and hardwaretechnology. The first edition of the Handbook of Combinatorial Optimization received a warmwelcomefromthescientificcommunity.Wearehappytointroducethesecond editionoftheHandbookofCombinatorialOptimization.Somematerialinthefirst editionhasbeenrevisedandseveralnewchaptershavebeenadded. Wearegratefultoallauthorsandrefereesfortheirvaluabletime.Moreover,we thankthepublisherandtheproductionteamforhelpingwitheditingthehandbook. Wehopethatthisbookwillcontinuetobeahelpfultoolforindividualsworkingin thefieldofcombinatorialoptimization. Acknowledgements.Wewouldliketoacknowledgethehelpofourstudentsduring the years of editing the handbook. We have also been partially supported by AirForce,NSF,andDTRAgrants. PanosM.Pardalos Ding-ZhuDu RonaldL.Graham v Contents Volume1 AUnifiedApproachforDominationProblemsonDifferent NetworkTopologies.............................................................. 1 ThangN.Dinh,D.T.NguyenandMyT.Thai AdvancedTechniquesforDynamicProgramming........................... 41 WolfgangBein AdvancesinGroupTesting ..................................................... 93 YongxiCheng AdvancesinSchedulingProblems ............................................. 145 MingLiuandFeifengZheng AlgebrizationandRandomizationMethods .................................. 171 LiangDingandBinFu AlgorithmicAspectsofDominationinGraphs............................... 221 GerardJennhwaChang AlgorithmsandMetaheuristicsforCombinatorialMatrices ............... 283 IliasS.Kotsireas AlgorithmsfortheSatisfiabilityProblem ..................................... 311 JohnFrancoandSeanWeaver Bin Packing Approximation Algorithms: Survey andClassification ................................................................ 455 Edward G. Coffman, Ja´nos Csirik, Ga´bor Galambos, SilvanoMartelloandDanieleVigo BinaryUnconstrainedQuadraticOptimizationProblem ................... 533 GaryA.Kochenberger,FredGloverandHaiboWang vii viii Contents CombinatorialOptimizationAlgorithms...................................... 559 ElisaPappalardo,BeyzaAhlatciogluOzkokandPanosM.Pardalos CombinatorialOptimizationinDataMining................................. 595 SamiraSaediandO.ErhunKundakcioglu CombinatorialOptimizationTechniquesforNetwork-Based DataMining ...................................................................... 631 OlegShirokikh,VladimirStozhkovandVladimirBoginski Volume2 CombinatorialOptimizationinTransportationand LogisticsNetworks............................................................... 673 ChrysafisVogiatzisandPanosM.Pardalos ComplexityIssuesonPTAS..................................................... 723 JianerChenandGeXia ComputingDistancesBetweenEvolutionaryTrees .......................... 747 BhaskarDasGupta,XinHe,TaoJiang,MingLi,JohnTromp, LushengWangandLouxinZhang ConnectedDominatingSetinWirelessNetworks............................ 783 Hongjie Du, Ling Ding, Weili Wu, Donghyun Kim, PanosM.PardalosandJamesWillson ConnectionsBetweenContinuousandDiscreteExtremum Problems,GeneralizedSystems,andVariationalInequalities.............. 835 CarlaAntoni,FrancoGiannessiandFabioTardella CoverageProblemsinSensorNetworks....................................... 899 MihaelaCardei DataCorrectingApproachforRoutingandLocationinNetworks........ 929 BorisGoldengorin DualIntegralityinCombinatorialOptimization............................. 995 XujinChen,XiaodongHuandWenanZang DynamicalSystemApproachestoCombinatorialOptimization ...........1065 JensStarke EfficientAlgorithmsforGeometricShortestPath QueryProblems..................................................................1125 DannyZ.Chen Contents ix EnergyEfficiencyinWirelessNetworks.......................................1155 HongweiDu,XiuzhenChengandDeyingLi EquitableColoringofGraphs..................................................1199 Ko-WeiLih FasterandSpace EfficientExactExponentialAlgorithms: CombinatorialandAlgebraicApproaches....................................1249 DongxiaoYu,YuexuanWang,Qiang-ShengHuaand FrancisC.M.Lau Fault-TolerantFacilityAllocation..............................................1293 HongShenandShihongXu FractionalCombinatorialOptimization.......................................1311 TomaszRadzik Volume3 FuzzyCombinatorialOptimizationProblems................................1357 PanosM.Pardalos,EmelKızılkayaAydogan,FeyzaGurbuz, OzgurDemirtasandBirceBogaBakirli GeometricOptimizationinWirelessNetworks...............................1415 WeiliWuandZhaoZhang Gradient-ConstrainedMinimumInterconnectionNetworks...............1459 MarcusBrazilandMarcusG.Volz GraphSearchingandRelatedProblems ......................................1511 AnthonyBonatoandBotingYang GraphTheoreticCliqueRelaxationsandApplications......................1559 BalabhaskarBalasundaramandFoadMahdaviPajouh GreedyApproximationAlgorithms............................................1599 Peng-JunWan HardnessandApproximationofNetworkVulnerability....................1631 MyT.Thai,ThangN.DinhandYilinShen JobShopSchedulingwithPetriNets ..........................................1667 HejiaoHuang,HongweiDuandFarooqAhmad KeyTreeOptimization ..........................................................1713 MinmingLi LinearProgrammingAnalysisofSwitchingNetworks......................1755 HungQ.NgoandThanh-NhanNguyen
The list of books you might like
