Inverse combinatorial optimization: A survey on problems, methods, and results

被引：222

作者：

Heuberger, C ^{[1
]}

机构：

[1] Graz Univ Technol, Inst Math B, A-8010 Graz, Austria

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2004年 / 8卷 / 03期

关键词：

inverse optimization; reverse optimization; network flow problems;

D O I：

10.1023/B:JOCO.0000038914.26975.9b

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：329 / 361

页数：33

共 76 条

[1] Combinatorial algorithms for inverse network flow problems [J].