Generalized Network Design Problems uses cookies, tags, and tracking settings to store information that help give you the very best browsing experience.
To understand more about cookies, tags, and tracking, see our Privacy Statement
I accept all cookies for the De Gruyter Online site

Jump to ContentJump to Main Navigation

129,95 € / $182.00 / £97.99*

eBook (PDF)

Publication Date:
October 2012

See all formats and pricing

eBook (PDF)
ISBN 978-3-11-026768-6
€ [D] 129.95 / US$ 182.00 / GBP 97.99*
ISBN 978-3-11-026758-7
€ [D] 129.95 / US$ 182.00 / GBP 97.99*
ISBN 978-3-11-026769-3
€ [D] 199.95 / US$ 280.00 / GBP 149.99*
*Prices in US$ apply to orders placed in the Americas only. Prices in GBP apply to orders placed in Great Britain only. Prices in € represent the retail prices valid in Germany (unless otherwise indicated). Prices are subject to change without notice. Prices do not include postage and handling. RRP: Recommended Retail Price.

    Pop, Petrica C.

    Generalized Network Design Problems

    Modeling and Optimization

    Series:De Gruyter Series in Discrete Mathematics and Applications 1

      Aims and Scope

      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.

      request permissions

      Supplementary Information

      Approx. x, 203 pages
      Type of Publication:
      Optimization; Network Design; Network Design Problem; Generalized Network Designed Problem; Integer Programming; Heuristic Algorithm, Metaheuristic Algorithm

      MARC record

      MARC record for eBook

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

      Please log in or register to comment.