Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results

被引：0
作者：
Clemens Heuberger
机构：
[1] Technische Universität Graz,Institut für Mathematik B
来源：
Journal of Combinatorial Optimization | 2004年 / 8卷
关键词：
inverse optimization; reverse optimization; network flow problems;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：329 / 361
页数：32
相关论文
共 123 条
[1]  
Ahuja R.K.(2000)A faster algorithm for the inverse spanning tree problem J. Algorithms 34 177-193
[2]  
Orlin J.B.(2001)Inverse optimization Oper. Res. 49 771-783
[3]  
Ahuja R.K.(2002)Combinatorial algorithms for inverse network flow problems Networks 40 181-187
[4]  
Orlin J.B.(1957)Two theorems in graph theory Proc. Nat. Acad. Sci. U.S.A. 43 842-844
[5]  
Ahuja R.K.(1992)Improving the location of minisum facilities through network modification Ann. Oper. Res. 40 1-16
[6]  
Orlin J.B.(1994)Improving the location of minimax facilities through network modification Networks 24 31-41
[7]  
Berge C.(2001)Bottleneck capacity expansion problems with general budget constraints RAIRO Oper. Res. 35 1-20
[8]  
Berman O.(2004)Weight reduction problems with certain bottleneck objectives European J. Oper. Res. 153 191-199
[9]  
Ingco D.I.(2004)Inverse median problems Discrete Optimization 1 23-39
[10]  
Odoni A.(1992)On an instance of the inverse shortest paths problem Math. Programming 53 45-61
12345678910