Generalized Network Design Problems : Modeling and Optimization / Petrica C. Pop.
By: Pop, Petrica C [author.].
Material type: BookSeries: De Gruyter Series in Discrete Mathematics and Applications , 1.Publisher: Berlin ; Boston : De Gruyter, [2012]Copyright date: ©2012Description: 1 online resource (203 p.).Content type: text Media type: computer Carrier type: online resourceISBN: 9783110267686.Subject(s): Combinatorial optimization | Computer networks -- Design and construction -- Mathematical models | Linear programming -- Electronic books | Modeling | Network | Optimization | MATHEMATICS / Discrete Mathematics | Generalized Network Designed Problem | Heuristic Algorithm, Metaheuristic Algorithm | Integer Programming | Network Design Problem | Network Design | OptimizationAdditional physical formats: No titleOnline resources: Click here to access online | Click here to access online | Cover Issued also in print.Frontmatter -- 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 -- Index
restricted access online access with authorization star
http://purl.org/coar/access_right/c_16ec
Combinatorial 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.
Issued also in print.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 28. Feb 2023)
There are no comments for this item.