LEADER 04405nam 22006615 450 001 9910462642403321 005 20211101211935.0 010 $a1-283-85668-9 010 $a3-11-026768-3 024 7 $a10.1515/9783110267686 035 $a(CKB)2670000000309339 035 $a(EBL)894081 035 $a(OCoLC)821198774 035 $a(SSID)ssj0000784883 035 $a(PQKBManifestationID)11435823 035 $a(PQKBTitleCode)TC0000784883 035 $a(PQKBWorkID)10783100 035 $a(PQKB)10243361 035 $a(DE-B1597)173597 035 $a(OCoLC)840441223 035 $a(DE-B1597)9783110267686 035 $a(MiAaPQ)EBC894081 035 $a(EXLCZ)992670000000309339 100 $a20190708d2012 fg 0 101 0 $aeng 135 $aurnn#---|u||u 181 $ctxt 182 $cc 183 $acr 200 10$aGeneralized Network Design Problems $eModeling and Optimization /$fPetrica C. Pop 210 1$aBerlin ;$aBoston :$cDe Gruyter,$d[2012] 210 4$dİ2012 215 $a1 online resource (216 p.) 225 0 $aDe Gruyter Series in Discrete Mathematics and Applications ;$v1 300 $aDescription based upon print version of record. 311 0 $a3-11-026758-6 327 $tFront matter --$tContents --$tChapter 1. Introduction --$tChapter 2. The Generalized Minimum Spanning Tree Problem (GMSTP) --$tChapter 3. The Generalized Traveling Salesman Problem (GTSP) --$tChapter 4. The Railway Traveling Salesman Problem (RTSP) --$tChapter 5. The Generalized Vehicle Routing Problem (GVRP) --$tChapter 6. The Generalized Fixed-Charge Network Design Problem (GFCNDP) --$tChapter 7. The Generalized Minimum Edge-Biconnected Network Problem (GMEBCNP) --$tBibliography --$tIndex 330 $aCombinatorial optimization is a fascinating topic. Combinatorial optimization problems arise in a wide variety of important fields such as transportation, telecommunications, computer networking, location, planning, distribution problems, etc. Important and significant results have been obtained on the theory, algorithms and applications over the last few decades. In combinatorial optimization, many network design problems can be generalized in a natural way by considering a related problem on a clustered graph, where the original problem's feasibility constraints are expressed in terms of the clusters, i.e., node sets instead of individual nodes. This class of problems is usually referred to as generalized network design problems (GNDPs) or generalized combinatorial optimization problems. The express purpose of this monograph is to describe a series of mathematical models, methods, propositions, algorithms developed in the last years on generalized network design problems in a unified manner. The book consists of seven chapters, where in addition to an introductory chapter, the following generalized network design problems are formulated and examined: the generalized minimum spanning tree problem, the generalized traveling salesman problem, the railway traveling salesman problem, the generalized vehicle routing problem, the generalized fixed-charge network design problem and the generalized minimum vertex-biconnected network problem. The book will be useful for researchers, practitioners, and graduate students in operations research, optimization, applied mathematics and computer science. Due to the substantial practical importance of some presented problems, researchers in other areas will find this book useful, too. 410 3$aDe Gruyter Series in Discrete Mathematics and Applications 606 $aComputer networks -- Design and construction -- Mathematical models 606 $aLinear programming 606 $aCombinatorial optimization$xDesign and construction$xMathematical models 606 $aComputer networks 606 $aLinear programming 608 $aElectronic books. 615 4$aComputer networks -- Design and construction -- Mathematical models. 615 4$aLinear programming. 615 0$aCombinatorial optimization$xDesign and construction$xMathematical models 615 0$aComputer networks 615 0$aLinear programming 676 $a519.64 700 $aPop$b Petrica C.$01032610 801 0$bDE-B1597 801 1$bDE-B1597 906 $aBOOK 912 $a9910462642403321 996 $aGeneralized Network Design Problems$92450578 997 $aUNINA