Generalized Network Design Problems : : Modeling and Optimization / / Petrica C. Pop.
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...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter DGBA Backlist Complete English Language 2000-2014 PART1 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Berlin ;, Boston : : De Gruyter, , [2012] ©2012 |
Year of Publication: | 2012 |
Language: | English |
Series: | De Gruyter Series in Discrete Mathematics and Applications ,
1 |
Online Access: | |
Physical Description: | 1 online resource (203 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
9783110267686 |
---|---|
ctrlnum |
(DE-B1597)173597 (OCoLC)821198774 |
collection |
bib_alma |
record_format |
marc |
spelling |
Pop, Petrica C., author. aut http://id.loc.gov/vocabulary/relators/aut Generalized Network Design Problems : Modeling and Optimization / Petrica C. Pop. Berlin ; Boston : De Gruyter, [2012] ©2012 1 online resource (203 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda De Gruyter Series in Discrete Mathematics and Applications , 2195-5557 ; 1 Frontmatter -- 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 restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star 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. Issued also in print. Mode of access: Internet via World Wide Web. In English. Description based on online resource; title from PDF title page (publisher's Web site, viewed 28. Feb 2023) Combinatorial optimization. Computer networks Design and construction Mathematical models. Linear programming Electronic books. Modeling. Network. Optimization. MATHEMATICS / Discrete Mathematics. bisacsh Generalized Network Designed Problem. Heuristic Algorithm, Metaheuristic Algorithm. Integer Programming. Network Design Problem. Network Design. Title is part of eBook package: De Gruyter DGBA Backlist Complete English Language 2000-2014 PART1 9783110238570 Title is part of eBook package: De Gruyter DGBA Backlist Mathematics 2000-2014 (EN) 9783110238471 Title is part of eBook package: De Gruyter DGBA Mathematics - 2000 - 2014 9783110637205 ZDB-23-GMA Title is part of eBook package: De Gruyter E-BOOK GESAMTPAKET / COMPLETE PACKAGE 2012 9783110288995 ZDB-23-DGG Title is part of eBook package: De Gruyter E-BOOK PACKAGE MATHEMATICS, PHYSICS, ENGINEERING 2012 9783110293722 ZDB-23-DMI Title is part of eBook package: De Gruyter E-BOOK PAKET MATHEMATIK, PHYSIK, INGENIEURWISS. 2012 9783110288926 ZDB-23-DMP print 9783110267587 https://doi.org/10.1515/9783110267686 https://www.degruyter.com/isbn/9783110267686 Cover https://www.degruyter.com/document/cover/isbn/9783110267686/original |
language |
English |
format |
eBook |
author |
Pop, Petrica C., Pop, Petrica C., |
spellingShingle |
Pop, Petrica C., Pop, Petrica C., Generalized Network Design Problems : Modeling and Optimization / De Gruyter Series in Discrete Mathematics and Applications , Frontmatter -- 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 |
author_facet |
Pop, Petrica C., Pop, Petrica C., |
author_variant |
p c p pc pcp p c p pc pcp |
author_role |
VerfasserIn VerfasserIn |
author_sort |
Pop, Petrica C., |
title |
Generalized Network Design Problems : Modeling and Optimization / |
title_sub |
Modeling and Optimization / |
title_full |
Generalized Network Design Problems : Modeling and Optimization / Petrica C. Pop. |
title_fullStr |
Generalized Network Design Problems : Modeling and Optimization / Petrica C. Pop. |
title_full_unstemmed |
Generalized Network Design Problems : Modeling and Optimization / Petrica C. Pop. |
title_auth |
Generalized Network Design Problems : Modeling and Optimization / |
title_alt |
Frontmatter -- 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 |
title_new |
Generalized Network Design Problems : |
title_sort |
generalized network design problems : modeling and optimization / |
series |
De Gruyter Series in Discrete Mathematics and Applications , |
series2 |
De Gruyter Series in Discrete Mathematics and Applications , |
publisher |
De Gruyter, |
publishDate |
2012 |
physical |
1 online resource (203 p.) Issued also in print. |
contents |
Frontmatter -- 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 |
isbn |
9783110267686 9783110238570 9783110238471 9783110637205 9783110288995 9783110293722 9783110288926 9783110267587 |
issn |
2195-5557 ; |
url |
https://doi.org/10.1515/9783110267686 https://www.degruyter.com/isbn/9783110267686 https://www.degruyter.com/document/cover/isbn/9783110267686/original |
illustrated |
Not Illustrated |
doi_str_mv |
10.1515/9783110267686 |
oclc_num |
821198774 |
work_keys_str_mv |
AT poppetricac generalizednetworkdesignproblemsmodelingandoptimization |
status_str |
n |
ids_txt_mv |
(DE-B1597)173597 (OCoLC)821198774 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Title is part of eBook package: De Gruyter DGBA Backlist Complete English Language 2000-2014 PART1 Title is part of eBook package: De Gruyter DGBA Backlist Mathematics 2000-2014 (EN) Title is part of eBook package: De Gruyter DGBA Mathematics - 2000 - 2014 Title is part of eBook package: De Gruyter E-BOOK GESAMTPAKET / COMPLETE PACKAGE 2012 Title is part of eBook package: De Gruyter E-BOOK PACKAGE MATHEMATICS, PHYSICS, ENGINEERING 2012 Title is part of eBook package: De Gruyter E-BOOK PAKET MATHEMATIK, PHYSIK, INGENIEURWISS. 2012 |
is_hierarchy_title |
Generalized Network Design Problems : Modeling and Optimization / |
container_title |
Title is part of eBook package: De Gruyter DGBA Backlist Complete English Language 2000-2014 PART1 |
_version_ |
1770177498460454912 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06061nam a22009255i 4500</leader><controlfield tag="001">9783110267686</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20230228123812.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">230228t20122012gw fo d z eng d</controlfield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)840441223</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110267686</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9783110267686</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)173597</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)821198774</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT008000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pop, Petrica C., </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Generalized Network Design Problems :</subfield><subfield code="b">Modeling and Optimization /</subfield><subfield code="c">Petrica C. Pop.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ;</subfield><subfield code="a">Boston : </subfield><subfield code="b">De Gruyter, </subfield><subfield code="c">[2012]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (203 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">De Gruyter Series in Discrete Mathematics and Applications ,</subfield><subfield code="x">2195-5557 ;</subfield><subfield code="v">1</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Chapter 1. Introduction -- </subfield><subfield code="t">Chapter 2. The Generalized Minimum Spanning Tree Problem (GMSTP) -- </subfield><subfield code="t">Chapter 3. The Generalized Traveling Salesman Problem (GTSP) -- </subfield><subfield code="t">Chapter 4. The Railway Traveling Salesman Problem (RTSP) -- </subfield><subfield code="t">Chapter 5. The Generalized Vehicle Routing Problem (GVRP) -- </subfield><subfield code="t">Chapter 6. The Generalized Fixed-Charge Network Design Problem (GFCNDP) -- </subfield><subfield code="t">Chapter 7. The Generalized Minimum Edge-Biconnected Network Problem (GMEBCNP) -- </subfield><subfield code="t">Bibliography -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 28. Feb 2023)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Combinatorial optimization.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer networks</subfield><subfield code="x">Design and construction</subfield><subfield code="x">Mathematical models.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Linear programming</subfield><subfield code="x">Electronic books.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Modeling.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Discrete Mathematics.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Generalized Network Designed Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Heuristic Algorithm, Metaheuristic Algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Integer Programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Network Design Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Network Design.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Optimization.</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">DGBA Backlist Complete English Language 2000-2014 PART1</subfield><subfield code="z">9783110238570</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">DGBA Backlist Mathematics 2000-2014 (EN)</subfield><subfield code="z">9783110238471</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">DGBA Mathematics - 2000 - 2014</subfield><subfield code="z">9783110637205</subfield><subfield code="o">ZDB-23-GMA</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">E-BOOK GESAMTPAKET / COMPLETE PACKAGE 2012</subfield><subfield code="z">9783110288995</subfield><subfield code="o">ZDB-23-DGG</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">E-BOOK PACKAGE MATHEMATICS, PHYSICS, ENGINEERING 2012</subfield><subfield code="z">9783110293722</subfield><subfield code="o">ZDB-23-DMI</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">E-BOOK PAKET MATHEMATIK, PHYSIK, INGENIEURWISS. 2012</subfield><subfield code="z">9783110288926</subfield><subfield code="o">ZDB-23-DMP</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9783110267587</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9783110267686</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9783110267686</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9783110267686/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-023847-1 DGBA Backlist Mathematics 2000-2014 (EN)</subfield><subfield code="c">2000</subfield><subfield code="d">2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-023857-0 DGBA Backlist Complete English Language 2000-2014 PART1</subfield><subfield code="c">2000</subfield><subfield code="d">2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_DGALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DGG</subfield><subfield code="b">2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DMI</subfield><subfield code="b">2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DMP</subfield><subfield code="b">2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-GMA</subfield><subfield code="c">2000</subfield><subfield code="d">2014</subfield></datafield></record></collection> |