Elias Munapo, Santosh Kumar, Philimon Nyamugure, Trust Tawanda
Network Optimization: An Introduction to the Network Reconstruction Approach
Network Reconstruction Approach to Optimization
Elias Munapo, Santosh Kumar, Philimon Nyamugure, Trust Tawanda
Network Optimization: An Introduction to the Network Reconstruction Approach
Network Reconstruction Approach to Optimization
- Gebundenes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
This book is an introduction to reconstruction concepts and its applications for solving some network optimization problems. The authors have developed many methods to find optimal solutions for these network related problems and they observed that various methods discussed within have a common thread of reconstruction which unites them.
Andere Kunden interessierten sich auch für
- Richard LassaigneLogic and Complexity123,99 €
- M. IglesiasFoundations of Generic Optimization38,99 €
- Richard LassaigneLogic and Complexity159,99 €
- ChelliahModel Optimization Methods for Efficient and Edge AI133,99 €
- Michel Goemans / Klaus Jansen / Jose D.P. Rolim / Luca Trevisan (eds.)Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques39,99 €
- Zhouchen LinAccelerated Optimization for Machine Learning112,99 €
- Zhouchen LinAccelerated Optimization for Machine Learning112,99 €
-
-
-
This book is an introduction to reconstruction concepts and its applications for solving some network optimization problems. The authors have developed many methods to find optimal solutions for these network related problems and they observed that various methods discussed within have a common thread of reconstruction which unites them.
Produktdetails
- Produktdetails
- Verlag: River Publishers
- Erscheinungstermin: 2. Juli 2025
- Englisch
- Abmessung: 234mm x 156mm x 14mm
- Gewicht: 513g
- ISBN-13: 9788770047425
- ISBN-10: 8770047421
- Artikelnr.: 73786460
- Herstellerkennzeichnung
- Libri GmbH
- Europaallee 1
- 36244 Bad Hersfeld
- gpsr@libri.de
- Verlag: River Publishers
- Erscheinungstermin: 2. Juli 2025
- Englisch
- Abmessung: 234mm x 156mm x 14mm
- Gewicht: 513g
- ISBN-13: 9788770047425
- ISBN-10: 8770047421
- Artikelnr.: 73786460
- Herstellerkennzeichnung
- Libri GmbH
- Europaallee 1
- 36244 Bad Hersfeld
- gpsr@libri.de
Elias Munapo holds a B.Sc. (Hons) in Applied Mathematics (1997), M.Sc. in Operations Research (2002) and a Ph.D. in Operations Research (2010), all from the National University of Science and Technology (NUST), Zimbabwe. He also has a certificate in outcomes-based assessment in Higher Education and Open Distance Learning, University of South Africa (UNISA) and a certificate in University Education Induction Program, University of KwaZulu-Natal (UKZN). He is a Professional Natural Scientist certified by the South African Council for Natural Scientific Professions (SACNASP), 2012; and NRF rated in South Africa. He has published/co-published over 120 articles and two books. He has also edited/co-edited 7 books and is a guest editor of Applied Sciences, Algorithms and Next Energy journals which are under MDPI. He has supervised/co-supervised eleven doctoral students and over 30 students at Master level. He is a member of the Operations Research Society of South Africa, Executive Committee Member 2012-13, South African Council for Natural Scientific Professions (SACNASP) as a Certified Natural Scientist, European Conference on Operational Research (EURO) and the International Federation of Operations Research Societies (IFORS), a member of the International Conference on Optimization (ICO) and is part of the team preparing to host ICO 2026 at Johannesburg. Santosh Kumar OAM received his Ph.D. degree in Operations Research from Delhi University. He is author and co-author of over 210 papers and 4 books in the field of operations research. His contributions in the field of OR have been recognized in the form of the 'Ren Pots' award from the Australian Society for operations Research (ASOR) in 2009 and a recognition award from the South African OR Society as a non-member of the society and a non-resident of South Africa in 2011. He was the President of the Asia Pacific Operations Research societies (1995-97), where ASOR was a member along with 7 other countries in the region. He is currently an Honorary Professor at RMIT University, Melbourne. He is a Fellow of the Institute of Mathematics and its Applications, UK. On 14 June 2021, he was awarded a medal of the Order of Australia (OAM). Philimon Nyamugure gained a B.Sc. (Hons) in 1998, an M.Sc. in 2002 and a Post Graduate Diploma in Higher Education in 2013, all from NUST, and a Ph.D. in Statistics, University of Limpopo, 2017. He joined NUST in 2003 and was Chairperson for the Departments of Applied Mathematics (2009-2013) and Chairman, Department of Statistics and Operations Research (2013-2019). He became Executive Dean of the Faculty of Applied Science from 2020 to date and a University Senator from 2009 and Councillor from 2020 to date. He received an award for the best Ph.D. presenter in the School of Mathematical and Computer Sciences, University of Limpopo. Best Senior presenter, Faculty of Applied Sciences, and in 2017 was awarded a Fulbright Research Award for African Scholars. He is involved in several community engagement programs including National University of Science and Technology Schools Enrichment Program (NUSTSEP). He is currently an Executive Dean and a Professor at NUST. Trust Tawanda is a seasoned academic and researcher with a strong background in Operations Research and Statistics. He holds a Bachelor of Science (Hons) in Operations Research and Statistics (2013), a Master of Science in Operations Research and Statistics (2017), and a Ph.D. in Operations Research (2024) from the National University of Science and Technology (NUST) in Zimbabwe. Currently, he is pursuing a Post Graduate Diploma in Higher and Tertiary Education (PGDHTE) at Great Zimbabwe University (GZU). As a Lecturer in the Department of Statistics and Operations Research at NUST's Faculty of Applied Sciences, he teaches and conducts research in his areas of expertise, which include network optimization problems, transportation problems, travelling salesman problems, and assignment problems. He has a notable publication record, with papers and book chapters to his credit. His academic journey and research endeavors demonstrate his commitment to advancing knowledge in operations research.
1. Network Reconstruction - Unification of an Assignment and Transportation
Models and Accelerating the Search Process 2. Reconstruction Approach for
the Shortest and the K^th Shortest Routes in Networks 3. Network
Reconstruction Approach to the Minimum Spanning Tree under the Index
Restriction 4. Path through 'K' Specified Nodes or 'K' Specified Links in
Networks: A Reconstruction Approach 5. Is Determination of the Travelling
Salesman Tour an NP Hard Problem? Some Polynomial Time Reconstruction
Approaches 6. TANYAKUMU Labelling Method: Exact Algorithm for the
Travelling Salesman problem (TSP) and equality generalized travelling
salesman problem (E-GTSP) 7. Some Reliability Routing Problems and their
Evaluation by Network Reconstruction 8. Reconstruction Approach to
Reliability and Maximum Flows in Networks
Models and Accelerating the Search Process 2. Reconstruction Approach for
the Shortest and the K^th Shortest Routes in Networks 3. Network
Reconstruction Approach to the Minimum Spanning Tree under the Index
Restriction 4. Path through 'K' Specified Nodes or 'K' Specified Links in
Networks: A Reconstruction Approach 5. Is Determination of the Travelling
Salesman Tour an NP Hard Problem? Some Polynomial Time Reconstruction
Approaches 6. TANYAKUMU Labelling Method: Exact Algorithm for the
Travelling Salesman problem (TSP) and equality generalized travelling
salesman problem (E-GTSP) 7. Some Reliability Routing Problems and their
Evaluation by Network Reconstruction 8. Reconstruction Approach to
Reliability and Maximum Flows in Networks
1. Network Reconstruction - Unification of an Assignment and Transportation
Models and Accelerating the Search Process 2. Reconstruction Approach for
the Shortest and the K^th Shortest Routes in Networks 3. Network
Reconstruction Approach to the Minimum Spanning Tree under the Index
Restriction 4. Path through 'K' Specified Nodes or 'K' Specified Links in
Networks: A Reconstruction Approach 5. Is Determination of the Travelling
Salesman Tour an NP Hard Problem? Some Polynomial Time Reconstruction
Approaches 6. TANYAKUMU Labelling Method: Exact Algorithm for the
Travelling Salesman problem (TSP) and equality generalized travelling
salesman problem (E-GTSP) 7. Some Reliability Routing Problems and their
Evaluation by Network Reconstruction 8. Reconstruction Approach to
Reliability and Maximum Flows in Networks
Models and Accelerating the Search Process 2. Reconstruction Approach for
the Shortest and the K^th Shortest Routes in Networks 3. Network
Reconstruction Approach to the Minimum Spanning Tree under the Index
Restriction 4. Path through 'K' Specified Nodes or 'K' Specified Links in
Networks: A Reconstruction Approach 5. Is Determination of the Travelling
Salesman Tour an NP Hard Problem? Some Polynomial Time Reconstruction
Approaches 6. TANYAKUMU Labelling Method: Exact Algorithm for the
Travelling Salesman problem (TSP) and equality generalized travelling
salesman problem (E-GTSP) 7. Some Reliability Routing Problems and their
Evaluation by Network Reconstruction 8. Reconstruction Approach to
Reliability and Maximum Flows in Networks