Generalized Network Design Problems: Modeling and  Optimization

Petrica C. Pop

Published by De Gruyter 2012

Generalized Network Design Problems

Modeling and Optimization

Petrica C. Pop

Volume 1 in the series De Gruyter Series in Discrete Mathematics and Applications

https://doi.org/10.1515/9783110267686

Overview
Contents

About this book

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.

Author / Editor information

Petrica C. Pop, North University of Baia Mare, Romania.

Supplementary Materials

Contents

Topics

Frontmatter Publicly Available Download PDF	i
Contents Requires Authentication Unlicensed Licensed Download PDF	vii
Chapter 1. Introduction Requires Authentication Unlicensed Licensed Download PDF	1
Chapter 2. The Generalized Minimum Spanning Tree Problem (GMSTP) Requires Authentication Unlicensed Licensed Download PDF	9
Chapter 3. The Generalized Traveling Salesman Problem (GTSP) Requires Authentication Unlicensed Licensed Download PDF	60
Chapter 4. The Railway Traveling Salesman Problem (RTSP) Requires Authentication Unlicensed Licensed Download PDF	100
Chapter 5. The Generalized Vehicle Routing Problem (GVRP) Requires Authentication Unlicensed Licensed Download PDF	128
Chapter 6. The Generalized Fixed-Charge Network Design Problem (GFCNDP) Requires Authentication Unlicensed Licensed Download PDF	167
Chapter 7. The Generalized Minimum Edge-Biconnected Network Problem (GMEBCNP) Requires Authentication Unlicensed Licensed Download PDF	178
Bibliography Requires Authentication Unlicensed Licensed Download PDF	188
Index Requires Authentication Unlicensed Licensed Download PDF	202

(Deutsch)

Language: English
Publisher: De Gruyter
Audience: Researchers, Practitioners, and Graduate Students in Operations Research, Optimization, Applied Mathematics and Computer Science; Practitioners confronted with Generalized Network Design Problems; Academic Libraries
Pages
- Front matter: 10
- Main content: 203
Illustrations
- Illustrations: 40
- Tables: 30
Keywords: Optimization; Network Design; Network Design Problem; Generalized Network Designed Problem; Integer Programming; Heuristic Algorithm; Metaheuristic Algorithm

eBook

Published: October 30, 2012
ISBN: 9783110267686

Hardcover

Published: October 29, 2012
ISBN: 9783110267587