Cargando…
Generalized Network Design Problems : Modeling and Optimization.
Generalized network design is a very hot topic of research. The monograph describes in a unified manner a series of mathematical models, methods, propositions, and algorithms developed in the last years on generalized network design problems. The book consists of seven chapters, where in addition to...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin :
De Gruyter,
2012.
|
| Colección: | De Gruyter series in discrete mathematics and applications ;
1. |
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_ocn821198774 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr |n|---||||| | ||
| 008 | 121205s2012 gw ob 001 0 eng d | ||
| 010 | |z 2012028924 | ||
| 040 | |a MERUC |b eng |e pn |c MERUC |d MHW |d YDXCP |d IUA |d OCLCO |d N$T |d UMC |d IDEBK |d OCLCO |d E7B |d DEBSZ |d OCLCQ |d OCLCO |d AU@ |d OCLCO |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d AZK |d OCLCO |d LOA |d AGLDB |d UAB |d MOR |d PIFAG |d OCLCQ |d MERUC |d OCLCQ |d ZCU |d DEGRU |d OCLCA |d U3W |d OCLCF |d STF |d WRM |d OCLCQ |d VTS |d NRAMU |d ICG |d INT |d VT2 |d OCLCQ |d WYU |d OCLCQ |d LEAUB |d DKC |d OCLCQ |d M8D |d UKAHL |d HS0 |d OCLCQ |d UKCRE |d SNU |d OCLCO |d OCLCQ |d OCLCO |d OCLCQ |d OCLCL | ||
| 019 | |a 880895034 |a 961572609 |a 962710873 |a 966264161 |a 966536042 |a 988429797 |a 991952250 |a 1037777279 |a 1038646017 |a 1045508579 |a 1055340877 |a 1066425442 |a 1081236451 |a 1153501923 | ||
| 020 | |a 9783110267686 |q (electronic bk.) | ||
| 020 | |a 3110267683 |q (electronic bk.) | ||
| 020 | |a 9783110267693 |q (set (hardcover + e-book)) | ||
| 020 | |a 3110267691 |q (set (hardcover + e-book)) | ||
| 020 | |z 9783110267587 |q (hardcover ; |q alk. paper) | ||
| 020 | |z 3110267586 |q (hardcover ; |q alk. paper) | ||
| 029 | 1 | |a AU@ |b 000052910041 | |
| 029 | 1 | |a AU@ |b 000053298679 | |
| 029 | 1 | |a DEBBG |b BV041907232 | |
| 029 | 1 | |a DEBBG |b BV043169449 | |
| 029 | 1 | |a DEBBG |b BV044164179 | |
| 029 | 1 | |a DEBSZ |b 397283067 | |
| 029 | 1 | |a DEBSZ |b 421283718 | |
| 029 | 1 | |a NZ1 |b 14830426 | |
| 035 | |a (OCoLC)821198774 |z (OCoLC)880895034 |z (OCoLC)961572609 |z (OCoLC)962710873 |z (OCoLC)966264161 |z (OCoLC)966536042 |z (OCoLC)988429797 |z (OCoLC)991952250 |z (OCoLC)1037777279 |z (OCoLC)1038646017 |z (OCoLC)1045508579 |z (OCoLC)1055340877 |z (OCoLC)1066425442 |z (OCoLC)1081236451 |z (OCoLC)1153501923 | ||
| 050 | 4 | |a QA402.5 |b .P65 2012 | |
| 072 | 7 | |a MAT |x 003000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 029000 |2 bisacsh | |
| 082 | 0 | 4 | |a 004.601/51964 |a 004.60151964 |a 519 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Pop, Petrică C. | |
| 245 | 1 | 0 | |a Generalized Network Design Problems : |b Modeling and Optimization. |
| 260 | |a Berlin : |b De Gruyter, |c 2012. | ||
| 300 | |a 1 online resource (ix, 203 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a De Gruyter Series in Discrete Mathematics and Applications ; |v 1 | |
| 504 | |a Includes bibliographical references and index. | ||
| 520 | |a Generalized network design is a very hot topic of research. The monograph describes in a unified manner a series of mathematical models, methods, propositions, and algorithms developed in the last years on generalized network design problems. The book consists of seven chapters, where in addition to an introductory chapter, a number of six generalized network design problems are formulated and examined. The book will be useful for researchers and graduate students interested in operations research, optimization, applied mathematics, and computer science due to the substantial practical importance of some presented problems. | ||
| 505 | 0 | |a Preface; 1 Introduction; 1.1 Combinatorial optimization and integer programming; 1.2 Complexity theory; 1.3 Heuristic and relaxation methods; 1.4 Generalized network design problems; 2 The Generalized Minimum Spanning Tree Problem (GMSTP); 2.1 Definition and complexity of the GMSTP; 2.2 An exact algorithm for the GMSTP; 2.3 Mathematical models of the GMSTP; 2.3.1 Formulations based on tree properties; 2.3.2 Formulations based on arborescence properties; 2.3.3 Flow based formulations; 2.3.4 A model based on Steiner tree properties; 2.3.5 Local-global formulation of the GMSTP. | |
| 505 | 8 | |a 2.4 Approximation results for the GMSTP2.4.1 Introduction; 2.4.2 Positive results: the design of the approximation algorithms; 2.4.3 A negative result for the GMSTP; 2.4.4 An approximation algorithm for the GMSTP with bounded cluster size; 2.5 Solving the GMSTP; 2.5.1 A branch-and-cut algorithm for solving the GMSTP; 2.5.2 A heuristic algorithm for solving the GMSTP; 2.5.3 Rooting procedure for solving the GMSTP; 2.5.4 Solving the GMSTP with Simulated Annealing; 2.6 Notes; 3 The Generalized Traveling Salesman Problem (GTSP); 3.1 Definition and complexity of the GTSP. | |
| 505 | 8 | |a 3.2 An efficient transformation of the GTSP into the TSP3.3 An exact algorithm for the Generalized Traveling Salesman Problem; 3.4 Integer programming formulations of the GTSP; 3.4.1 Formulations based on the properties of Hamiltonian tours; 3.4.2 Flow based formulations; 3.4.3 A local-global formulation; 3.5 Solving the Generalized Traveling Salesman Problem; 3.5.1 Reinforcing ant colony system for solving the GTSP; 3.5.2 Computational results; 3.5.3 A hybrid heuristic approach for solving the GTSP; 3.5.4 Computational results; 3.6 The drilling problem; 3.6.1 Stigmergy and autonomous robots. | |
| 505 | 8 | |a 3.6.2 Sensitive robots3.6.3 Sensitive robot metaheuristic for solving the drilling problem; 3.6.4 Numerical experiments; 3.7 Notes; 4 The Railway Traveling Salesman Problem (RTSP); 4.1 Definition of the RTSP; 4.2 Preliminaries; 4.3 Methods for solving the RTSP; 4.3.1 The size reduction method through shortest paths; 4.3.2 A cutting plane approach for the RTSP; 4.3.3 Solving the RTSP via a transformation into the classical TSP; 4.3.4 An ant-based heuristic for solving the RTSP; 4.4 Dynamic Railway Traveling Salesman Problem; 4.4.1 Ant colony approach to the Dynamic RTSP. | |
| 505 | 8 | |a 4.4.2 Implementation details and computational results4.5 Notes; 5 The Generalized Vehicle Routing Problem (GVRP); 5.1 Definition and complexity of the GVRP; 5.2 An efficient transformation of the GVRP into a capacitated arc routing problem; 5.3 Integer linear programming formulations of the GVRP; 5.3.1 A general formulation; 5.3.2 A node based formulation; 5.3.3 Flow based formulations; 5.4 A numerical example; 5.5 Special cases of the proposed formulations; 5.5.1 The Generalized multiple Traveling Salesman Problem; 5.5.2 The Generalized Traveling Salesman Problem. | |
| 505 | 8 | |a 5.5.3 The Clustered Generalized Vehicle Routing Problem. | |
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 650 | 0 | |a Combinatorial optimization. | |
| 650 | 0 | |a Computer networks |x Design and construction |x Mathematical models. | |
| 650 | 0 | |a Linear programming. | |
| 650 | 6 | |a Optimisation combinatoire. | |
| 650 | 6 | |a Programmation linéaire. | |
| 650 | 7 | |a MATHEMATICS |x Applied. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Probability & Statistics |x General. |2 bisacsh | |
| 650 | 7 | |a Combinatorial optimization |2 fast | |
| 650 | 7 | |a Linear programming |2 fast | |
| 650 | 7 | |a Civil & Environmental Engineering. |2 hilcc | |
| 650 | 7 | |a Engineering & Applied Sciences. |2 hilcc | |
| 650 | 7 | |a Operations Research. |2 hilcc | |
| 758 | |i has work: |a Generalized Network Design Problems (Text) |1 https://id.oclc.org/worldcat/entity/E39PCG9TP9KXMq937KdDjChgyq |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Pop, Petrică C. |t Generalized network design problems |z 9783110267587 |w (DLC) 2012028924 |w (OCoLC)783142428 |
| 830 | 0 | |a De Gruyter series in discrete mathematics and applications ; |v 1. | |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=894081 |z Texto completo |
| 938 | |a YBP Library Services |b YANK |n 7624797 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n cis24364470 | ||
| 938 | |a EBSCOhost |b EBSC |n 522478 | ||
| 938 | |a ebrary |b EBRY |n ebr10634452 | ||
| 938 | |a De Gruyter |b DEGR |n 9783110267686 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH25311665 | ||
| 994 | |a 92 |b IZTAP | ||