國立高雄大學圖資館 |

登入

回首頁

Inverse combinatorial optimization problems

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Inverse combinatorial optimization problemsby Xiucui Guan, Panos M. Pardalos, Binwu Zhang.
作者:	Guan, Xiucui.
其他作者:	Pardalos, P. M.
出版者:	Cham :Springer Nature Switzerland :2025.
面頁冊數:	xxx, 367 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Combinatorial optimization.
電子資源:	https://doi.org/10.1007/978-3-031-91175-0
ISBN:	9783031911750$q(electronic bk.)

Inverse combinatorial optimization problems
Guan, Xiucui.

Inverse combinatorial optimization problems[electronic resource] /by Xiucui Guan, Panos M. Pardalos, Binwu Zhang. - Cham :Springer Nature Switzerland :2025. - xxx, 367 p. :ill. (some col.), digital ;24 cm. - Springer optimization and its applications,v. 2251931-6836 ;. - Springer optimization and its applications ;v. 3..

Preface -- 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.

This 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.

ISBN: 9783031911750$q(electronic bk.)

Standard No.: 10.1007/978-3-031-91175-0doiSubjects--Topical Terms:

185796
Combinatorial optimization.

LC Class. No.: QA402.5

Dewey Class. No.: 519.64

Inverse combinatorial optimization problems
LDR:03504nmm a2200337 a 4500 001 682843
003 DE-He213
005 20250724130256.0
006 m d
007 cr nn 008maaau
008 251209s2025 sz s 0 eng d
020 $a 9783031911750$q(electronic bk.)
020 $a 9783031911743$q(paper)
024 7 $a 10.1007/978-3-031-91175-0 $2 doi
035 $a 978-3-031-91175-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5
072 7 $a PBU $2 bicssc
072 7 $a MAT042000 $2 bisacsh
072 7 $a PBU $2 thema
082 0 4 $a 519.64 $2 23
090 $a QA402.5 $b .G913 2025
100 1 $a Guan, Xiucui. $3 996665
245 1 0 $a Inverse combinatorial optimization problems $h [electronic resource] / $c by Xiucui Guan, Panos M. Pardalos, Binwu Zhang.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xxx, 367 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Springer optimization and its applications, $x 1931-6836 ; $v v. 225
505 0 $a Preface -- 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.
520 $a This 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.
650 0 $a Combinatorial optimization. $3 185796
650 1 4 $a Optimization. $3 274084
650 2 4 $a Discrete Mathematics. $3 524738
650 2 4 $a Applications of Mathematics. $3 273744
700 1 $a Pardalos, P. M. $3 914933
700 1 $a Zhang, Binwu. $3 996666
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Springer optimization and its applications ; $v v. 3. $3 440366
856 4 0 $u https://doi.org/10.1007/978-3-031-91175-0
950 $a Mathematics and Statistics (SpringerNature-11649)