View in EDS PDF Full Text

Generalized Network Design Problems : Modeling and Optimization

Saved in:
Bibliographic Details
Title: Generalized Network Design Problems : Modeling and Optimization
Description: 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.
Authors: Petrica C. Pop
Resource Type: eBook.
Subjects: Linear programming, Combinatorial optimization, Computer networks--Design and construction--Mathematical models
Categories: MATHEMATICS / Discrete Mathematics, COMPUTERS / Computer Science, COMPUTERS / Information Theory, MATHEMATICS / Applied, MATHEMATICS / Finite Mathematics
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 522478
RelevancyScore: 1044
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 1044.26904296875
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$522478$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$522478$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Generalized Network Design Problems : Modeling and Optimization
– Name: Abstract
  Label: Description
  Group: Ab
  Data: 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.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Petrica+C%2E+Pop%22">Petrica C. Pop</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Linear+programming%22">Linear programming</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatorial+optimization%22">Combinatorial optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+networks--Design+and+construction--Mathematical+models%22">Computer networks--Design and construction--Mathematical models</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Discrete+Mathematics%22">MATHEMATICS / Discrete Mathematics</searchLink><br /><searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Computer+Science%22">COMPUTERS / Computer Science</searchLink><br /><searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Information+Theory%22">COMPUTERS / Information Theory</searchLink><br /><searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Applied%22">MATHEMATICS / Applied</searchLink><br /><searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Finite+Mathematics%22">MATHEMATICS / Finite Mathematics</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=522478
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 004.60151964
        Scheme: ddc
        Type: prePub
      – Code: 004.60151964
        Scheme: ddc
        Type: prePub
      – Code: 519
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Linear programming
        Type: general
      – SubjectFull: Combinatorial optimization
        Type: general
      – SubjectFull: Computer networks--Design and construction--Mathematical models
        Type: general
    Titles:
      – TitleFull: Generalized Network Design Problems : Modeling and Optimization
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Petrica C. Pop
      – PersonEntity:
          Name:
            NameFull: Petrica C. Pop
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2012
            – D: 04
              M: 02
              Type: profile
              Y: 2014
          Identifiers:
            – Type: isbn-print
              Value: 9783110267587
            – Type: isbn-electronic
              Value: 9783110267686
          Numbering:
            – Type: volume
              Value: 00001
          Titles:
            – TitleFull: Generalized Network Design Problems : Modeling and Optimization
              Type: main
ResultId 1