04626nam 22007215 450 991078643510332120230801225737.01-283-85668-93-11-026768-310.1515/9783110267686(CKB)2670000000309339(EBL)894081(OCoLC)821198774(SSID)ssj0000784883(PQKBManifestationID)11435823(PQKBTitleCode)TC0000784883(PQKBWorkID)10783100(PQKB)10243361(DE-B1597)173597(OCoLC)840441223(DE-B1597)9783110267686(MiAaPQ)EBC894081(EXLCZ)99267000000030933920190708d2012 fg 0engurnn#---|u||utxtccrGeneralized Network Design Problems Modeling and Optimization /Petrica C. PopBerlin ;Boston :De Gruyter,[2012]©20121 online resource (216 p.)De Gruyter Series in Discrete Mathematics and Applications ;1Description based upon print version of record.3-11-026758-6 Front matter --Contents --Chapter 1. Introduction --Chapter 2. The Generalized Minimum Spanning Tree Problem (GMSTP) --Chapter 3. The Generalized Traveling Salesman Problem (GTSP) --Chapter 4. The Railway Traveling Salesman Problem (RTSP) --Chapter 5. The Generalized Vehicle Routing Problem (GVRP) --Chapter 6. The Generalized Fixed-Charge Network Design Problem (GFCNDP) --Chapter 7. The Generalized Minimum Edge-Biconnected Network Problem (GMEBCNP) --Bibliography --IndexCombinatorial 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.De Gruyter Series in Discrete Mathematics and ApplicationsComputer networks -- Design and construction -- Mathematical modelsLinear programmingCombinatorial optimizationDesign and constructionMathematical modelsComputer networksLinear programmingGeneralized Network Designed Problem.Heuristic Algorithm, Metaheuristic Algorithm.Integer Programming.Network Design Problem.Network Design.Optimization.Computer networks -- Design and construction -- Mathematical models.Linear programming.Combinatorial optimizationDesign and constructionMathematical modelsComputer networksLinear programming519.64Pop Petrica C.1575489DE-B1597DE-B1597BOOK9910786435103321Generalized Network Design Problems3852495UNINA