LEADER 01120nam a22002531i 4500 001 991001503129707536 005 20030225192444.0 008 030121s1975 sz |||||||||||||||||fre 035 $ab12156279-39ule_inst 035 $aARCHE-024607$9ExL 040 $aDip.to Filologia Ling. e Lett.$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 082 04$a016.843 100 1 $aWoledge, Brian$0172747 245 10$aBibliographie des romans et nouvelles en prose française anterieurs à 1500 :$bsupplement 1954-1973 /$cBrian Woledge 260 $aGenève :$bDroz,$c1975 300 $a138 p. ;$c25 cm 440 0$aSociété de Publications romanes et françaises ;$v130 650 4$aLetteratura narrativa francese$ySec. 13.-15.$aBibliografie 907 $a.b12156279$b02-04-14$c01-04-03 912 $a991001503129707536 945 $aLE008 FL.M. (f.r.) II 34/a$g1$i2008000490720$lle008$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i12486486$z01-04-03 996 $aBibliographie des romans et nouvelles en prose française antérieurs à 1500$9100473 997 $aUNISALENTO 998 $ale008$b01-04-03$cm$da $e-$ffre$gsz $h0$i1 LEADER 04508nam 22007095 450 001 9910964407703321 005 20240516151120.0 010 $a9781283856683 010 $a1283856689 010 $a9783110267686 010 $a3110267683 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(Perlego)404184 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 205 $a1st ed. 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 $a9783110267587 311 0 $a3110267586 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 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.$01853970 801 0$bDE-B1597 801 1$bDE-B1597 906 $aBOOK 912 $a9910964407703321 996 $aGeneralized Network Design Problems$94450916 997 $aUNINA