Generalized Network Design Problems
Modeling and Optimization
Seiten
2012
De Gruyter (Verlag)
978-3-11-026758-7 (ISBN)
De Gruyter (Verlag)
978-3-11-026758-7 (ISBN)
This series is devoted to the publication of high-level monographs which cover the whole spectrum of current discrete mathematics and its applications in various fields. One of its main objectives is to make available to the professional community expositions of results and foundations of methods that play an important role in both the theory and applications of discrete mathematics.
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.
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.
Petrica C. Pop, North University of Baia Mare, Romania.
Chapter 1: Introduction
Chapter 2: The generalized minimum spanning tree problem
Chapter 3: The generalized traveling salesman problem
Chapter 4: The railway traveling salesman problem
Chapter 5: The generalized vehicle routing problem
Chapter 6: The generalized fixed-charge network design problem
| Erscheint lt. Verlag | 29.10.2012 |
|---|---|
| Reihe/Serie | De Gruyter Series in Discrete Mathematics and Applications ; 1 |
| Zusatzinfo | 40 b/w ill., 30 b/w tbl. |
| Verlagsort | Berlin/Boston |
| Sprache | englisch |
| Maße | 170 x 240 mm |
| Gewicht | 500 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika |
| Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
| Schlagworte | Generalized Network Designed Problem • Heuristic Algorithm • Heuristic Algorithm, Metaheuristic Algorithm • Integer Programming • metaheuristic algorithm • Modeling • Network • network design • Network Design Problem • Netzwerke • Optimization • Optimization; Network Design; Network Design Problem; Generalized Network Designed Problem; Integer Programming; Heuristic Algorithm, Metaheuristic Algorithm |
| ISBN-10 | 3-11-026758-6 / 3110267586 |
| ISBN-13 | 978-3-11-026758-7 / 9783110267587 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
