zbMATH — the first resource for mathematics

Inverse combinatorial optimization: a survey on problems, methods, and results. (English) Zbl 1084.90035
Summary: Given a (combinatorial) optimization problem and a feasible solution to it, the corresponding inverse optimization problem is to find a minimal adjustment of the cost function such that the given solution becomes optimum. Several such problems have been studied in the last twelve years. After formalizing the notion of an inverse problem and its variants, we present various methods for solving them. Then we discuss the problems considered in the literature and the results that have been obtained. Finally, we formulate some open problems.

90C27 Combinatorial optimization
90C35 Programming involving graphs or networks
90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
PDF BibTeX Cite
Full Text: DOI