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!
|
LEADER | 06061nam a22009255i 4500 | ||
---|---|---|---|
001 | 9783110267686 | ||
003 | DE-B1597 | ||
005 | 20230228123812.0 | ||
006 | m|||||o||d|||||||| | ||
007 | cr || |||||||| | ||
008 | 230228t20122012gw fo d z eng d | ||
019 | |a (OCoLC)840441223 | ||
020 | |a 9783110267686 | ||
024 | 7 | |a 10.1515/9783110267686 |2 doi | |
035 | |a (DE-B1597)173597 | ||
035 | |a (OCoLC)821198774 | ||
040 | |a DE-B1597 |b eng |c DE-B1597 |e rda | ||
041 | 0 | |a eng | |
044 | |a gw |c DE | ||
072 | 7 | |a MAT008000 |2 bisacsh | |
100 | 1 | |a Pop, Petrica C., |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
245 | 1 | 0 | |a Generalized Network Design Problems : |b Modeling and Optimization / |c Petrica C. Pop. |
264 | 1 | |a Berlin ; |a Boston : |b De Gruyter, |c [2012] | |
264 | 4 | |c ©2012 | |
300 | |a 1 online resource (203 p.) | ||
336 | |a text |b txt |2 rdacontent | ||
337 | |a computer |b c |2 rdamedia | ||
338 | |a online resource |b cr |2 rdacarrier | ||
347 | |a text file |b PDF |2 rda | ||
490 | 0 | |a De Gruyter Series in Discrete Mathematics and Applications , |x 2195-5557 ; |v 1 | |
505 | 0 | 0 | |t Frontmatter -- |t Contents -- |t Chapter 1. Introduction -- |t Chapter 2. The Generalized Minimum Spanning Tree Problem (GMSTP) -- |t Chapter 3. The Generalized Traveling Salesman Problem (GTSP) -- |t Chapter 4. The Railway Traveling Salesman Problem (RTSP) -- |t Chapter 5. The Generalized Vehicle Routing Problem (GVRP) -- |t Chapter 6. The Generalized Fixed-Charge Network Design Problem (GFCNDP) -- |t Chapter 7. The Generalized Minimum Edge-Biconnected Network Problem (GMEBCNP) -- |t Bibliography -- |t Index |
506 | 0 | |a restricted access |u http://purl.org/coar/access_right/c_16ec |f online access with authorization |2 star | |
520 | |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. | ||
530 | |a Issued also in print. | ||
538 | |a Mode of access: Internet via World Wide Web. | ||
546 | |a In English. | ||
588 | 0 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 28. Feb 2023) | |
650 | 0 | |a Combinatorial optimization. | |
650 | 0 | |a Computer networks |x Design and construction |x Mathematical models. | |
650 | 0 | |a Linear programming |x Electronic books. | |
650 | 4 | |a Modeling. | |
650 | 4 | |a Network. | |
650 | 4 | |a Optimization. | |
650 | 7 | |a MATHEMATICS / Discrete Mathematics. |2 bisacsh | |
653 | |a Generalized Network Designed Problem. | ||
653 | |a Heuristic Algorithm, Metaheuristic Algorithm. | ||
653 | |a Integer Programming. | ||
653 | |a Network Design Problem. | ||
653 | |a Network Design. | ||
653 | |a Optimization. | ||
773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t DGBA Backlist Complete English Language 2000-2014 PART1 |z 9783110238570 |
773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t DGBA Backlist Mathematics 2000-2014 (EN) |z 9783110238471 |
773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t DGBA Mathematics - 2000 - 2014 |z 9783110637205 |o ZDB-23-GMA |
773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t E-BOOK GESAMTPAKET / COMPLETE PACKAGE 2012 |z 9783110288995 |o ZDB-23-DGG |
773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t E-BOOK PACKAGE MATHEMATICS, PHYSICS, ENGINEERING 2012 |z 9783110293722 |o ZDB-23-DMI |
773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t E-BOOK PAKET MATHEMATIK, PHYSIK, INGENIEURWISS. 2012 |z 9783110288926 |o ZDB-23-DMP |
776 | 0 | |c print |z 9783110267587 | |
856 | 4 | 0 | |u https://doi.org/10.1515/9783110267686 |
856 | 4 | 0 | |u https://www.degruyter.com/isbn/9783110267686 |
856 | 4 | 2 | |3 Cover |u https://www.degruyter.com/document/cover/isbn/9783110267686/original |
912 | |a 978-3-11-023847-1 DGBA Backlist Mathematics 2000-2014 (EN) |c 2000 |d 2014 | ||
912 | |a 978-3-11-023857-0 DGBA Backlist Complete English Language 2000-2014 PART1 |c 2000 |d 2014 | ||
912 | |a EBA_BACKALL | ||
912 | |a EBA_CL_CHCOMSGSEN | ||
912 | |a EBA_DGALL | ||
912 | |a EBA_EBACKALL | ||
912 | |a EBA_EBKALL | ||
912 | |a EBA_ECL_CHCOMSGSEN | ||
912 | |a EBA_EEBKALL | ||
912 | |a EBA_ESTMALL | ||
912 | |a EBA_STMALL | ||
912 | |a GBV-deGruyter-alles | ||
912 | |a PDA12STME | ||
912 | |a PDA13ENGE | ||
912 | |a PDA18STMEE | ||
912 | |a PDA5EBK | ||
912 | |a ZDB-23-DGG |b 2012 | ||
912 | |a ZDB-23-DMI |b 2012 | ||
912 | |a ZDB-23-DMP |b 2012 | ||
912 | |a ZDB-23-GMA |c 2000 |d 2014 |