LEADER 04796nam 22007455 450 001 9911018651703321 005 20260216154229.0 010 $a9783031911750$b(eBook) 024 7 $a10.1007/978-3-031-91175-0 035 $a(MiAaPQ)EBC32235411 035 $a(Au-PeEL)EBL32235411 035 $a(CKB)39713177700041 035 $a(DE-He213)978-3-031-91175-0 035 $a(OCoLC)1530377947 035 $a(EXLCZ)9939713177700041 100 $a20250724h20252025 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aInverse Combinatorial Optimization Problems /$fXiucui Guan, Panos M. Pardalos, Binwu Zhang 210 1$aCham :$cSpringer,$d[2025] 210 4$dŠ2025 215 $a1 online resource (xxx, 367 pages) $cillustrations 225 1 $aSpringer optimization and its applications,$x1931-6836 ;$vvolume 225 311 08$a9783031911743 320 $aIncludes bibliographical references. 327 $aPreface -- Part I. An Introduction to Inverse Combinatorial Optimization Problems -- An Outline of Inverse Combinatorial Optimization Problems -- Generalized Inverse Bottleneck Optimization Problems -- Generalized Inverse Maximum Capacity Path Problems -- Some General Methods to Solve Inverse Linear Programming Problem under Weighted ?1 Norm -- Part II. Generalized Inverse Shortest Path Problems -- Shortest Path Improvement Problems -- Shortest Path Interdiction Problems on Trees -- Sum of Root-leaf Distance Interdiction Problems on Trees -- Restricted Inverse Optimal Value Problem on Shortest Path under Weighted ?1 Norm on Trees -- Part III. Generalized Inverse Spanning Tree Problems -- Inverse Minimum Spanning Tree Problems -- Inverse Max+Sum Spanning Tree Problems -- Restricted Inverse Optimal Value Problem on Minimum Spanning Tree -- Partial Inverse Minimum Spanning Tree Problems -- Part IV. Generalized Inverse Center Location Problems -- Inverse vertex obnoxious 1-center location problems -- Inverse Quickest 1-Center Location Problem on Trees -- References. 330 $aThis book offers as exploration into the emerging field of Inverse Combinatorial Optimization Problems (ICOPs), a transformative area within operations research. As traditional optimization focuses on maximizing or minimizing objectives under constraints, ICOPs reverse this process, allowing for the inference of hidden parameters from observed outcomes. This monograph provides a comprehensive framework for understanding and applying ICOPs across various domains. Key concepts such as inverse shortest path, spanning tree, and center location problems are meticulously examined, offering theoretical insights and algorithmic solutions. The authors present a structured approach to these complex problems, making this work an essential resource for both academic and practical applications. By addressing critical questions and providing algorithmic tools, this book is a must-read for those seeking to enhance network design, logistics, and strategic planning. Researchers, academics, and practitioners in operations research and management science will find this monograph invaluable. It not only contributes to academic discourse but also equips professionals with the knowledge to tackle real-world challenges. This book is a vital addition to any library supporting advanced studies in optimization and decision-making processes. 410 0$aSpringer optimization and its applications ;$vv. 225.$x1931-6836 606 $aCombinatorial optimization 606 $aMathematical optimization 606 $aDiscrete mathematics 606 $aMathematics 606 $aOptimization 606 $aDiscrete Mathematics 606 $aApplications of Mathematics 606 $aMatemātica aplicada$2thub 606 $aOptimitzaciķ matemātica$2thub 606 $aOptimitzaciķ combinatōria$2thub 606 $aMatemātica discreta$2thub 608 $aLlibres electrōnics$2thub 615 0$aCombinatorial optimization. 615 0$aMathematical optimization. 615 0$aDiscrete mathematics. 615 0$aMathematics. 615 14$aOptimization. 615 24$aDiscrete Mathematics. 615 24$aApplications of Mathematics. 615 7$aMatemātica aplicada 615 7$aOptimitzaciķ matemātica 615 7$aOptimitzaciķ combinatōria. 615 7$aMatemātica discreta 676 $a519.6 700 $aGuan$b Xiucui$01836907 702 $aPardalos$b P. M$g(Panos M.),$f1954- 702 $aZhang$b Binwu 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9911018651703321 996 $aInverse Combinatorial Optimization Problems$94462369 997 $aUNINA