TY - BOOK ID - 77928901 TI - Generalized Network Design Problems : Modeling and Optimization PY - 2012 SN - 1283856689 3110267683 9783110267686 9783110267693 3110267691 9783110267587 3110267586 9781283856683 PB - Berlin ; Boston : De Gruyter, DB - UniCat KW - Combinatorial optimization. KW - Computer networks -- Design and construction -- Mathematical models. KW - Linear programming. KW - Combinatorial optimization KW - Computer networks KW - Linear programming KW - Civil & Environmental Engineering KW - Engineering & Applied Sciences KW - Operations Research KW - Communication systems, Computer KW - Computer communication systems KW - Data networks, Computer KW - ECNs (Electronic communication networks) KW - Electronic communication networks KW - Networks, Computer KW - Teleprocessing networks KW - Data transmission systems KW - Digital communications KW - Electronic systems KW - Information networks KW - Telecommunication KW - Cyberinfrastructure KW - Electronic data processing KW - Network computers KW - Optimization, Combinatorial KW - Combinatorial analysis KW - Mathematical optimization KW - Production scheduling KW - Programming (Mathematics) KW - Design and construction KW - Mathematical models KW - Distributed processing KW - Generalized Network Designed Problem. KW - Heuristic Algorithm, Metaheuristic Algorithm. KW - Integer Programming. KW - Network Design Problem. KW - Network Design. KW - Optimization. KW - Mathematical models. UR - https://www.unicat.be/uniCat?func=search&query=sysid:77928901 AB - 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. ER -