Inverse Combinatorial Optimization Problems. Questo articolo non è disponibile.Inverse Combinatorial Optimization Problems

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.