Generalized Network Design Problems : Modeling and Optimization / Petrica C. Pop.

Format:

Book

Author/Creator:

Pop, Petrică C., author.

Series:

De Gruyter Series in Discrete Mathematics and Applications

De Gruyter Series in Discrete Mathematics and Applications ; 1

Language:

English

Subjects (All):

Computer networks--Design and construction--Mathematical models.

Linear programming.

Combinatorial optimization--Design and construction--Mathematical models.

Combinatorial optimization.

Computer networks.

Local Subjects:

Computer networks--Design and construction--Mathematical models.

Linear programming.

Physical Description:

1 online resource (216 p.)

Edition:

1st ed.

Place of Publication:

Berlin ; Boston : De Gruyter, [2012]

Language Note:

English

Summary:

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.

Contents:

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

Index

Notes:

Description based upon print version of record.

Description based on online resource; title from PDF title page (publisher's Web site, viewed 08. Jul 2019)

ISBN:

9781283856683

1283856689

9783110267686

3110267683

OCLC:

821198774