Inverse Combinatorial Optimization Problems

Xiucui Guan, Panos M. Pardalos, Binwu Zhang (Autoren)

Buch | Hardcover

XXX, 367 Seiten

2025
Springer International Publishing (Verlag)
978-3-031-91174-3 (ISBN)

Artikel merken

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.

Xiucui Guan obtained her Ph.D. at City University of Hong Kong on 2005 majoring in combinatorial optimization. After graduation, she worked as a lecturer from May 2005 to April 2007 and an associate professor from May 2007 to April 2018 at School of Mathematics, Southeast University, China. She has been employed as a professor of School of Mathematics since May 2018. I had visited Prof. Panos M. Pardalos at Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida for one year since February 2013.

Her research interest includes discrete optimization, inverse combinatorial optimization, linear programming, algorithm design and analysis, etc. She has published more than 40 papers on combinatorial optimization, including more than 20 SCI indexed papers. I have been supported by 6 projects and 3 of them were supported by National Natural Science Foundation of China. I have cultivated 17 graduate students to obtain their masters degree at Mathematics and 3 Ph.D. students.

I mainly study on Inverse Combinatorial Optimization Problems (ICOP) including inverse linear programming problems, inverse minimum/max+sum spanning tree problems, inverse center/median location problems, shortest path improvement/interdiction problems, etc. We built mathematical models for these ICOPs, analyzed their properties and designed efficient algorithms to solve them. There are many applications of ICOPs in the field of transportation networks, communication networks, geophysical sciences, electricity markets, medical decision-making areas, etc. Researches on the ICOPs can help solve their corresponding problems in applications.

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.

Erscheinungsdatum	27.07.2025
Reihe/Serie	Springer Optimization and Its Applications
Zusatzinfo	XXX, 367 p. 26 illus., 17 illus. in color.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
Schlagworte	center location • inverse optimization • maximum flow • median location • Minimum Cost Flow • Minimum cut • minimum spanning tree • network improvement problem • network interdiction problem • shortest path
ISBN-10	3-031-91174-1 / 3031911741
ISBN-13	978-3-031-91174-3 / 9783031911743
Zustand	Neuware