Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results
暂无分享,去创建一个
[1] C Berge,et al. TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.
[2] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .
[3] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[4] Delbert Ray Fulkerson,et al. Maximizing the minimum source-sink path subject to a budget constraint , 1977, Math. Program..
[5] András Frank,et al. A Weighted Matroid Intersection Algorithm , 1981, J. Algorithms.
[6] A. Frank. An Algorithm for Submodular Functions on Graphs , 1982 .
[7] E. L. Lawler,et al. Computing Maximal "Polymatroidal" Network Flows , 1982, Math. Oper. Res..
[8] Refael Hassin,et al. Minimum cost flow with set-constraints , 1982, Networks.
[9] Donald Goldfarb,et al. A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..
[10] A. Schrijver. Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions , 1984 .
[11] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..
[12] Eric R. Zieyel. Operations research : applications and algorithms , 1988 .
[13] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[14] T. Moser. Shortest path calculation of seismic rays , 1991 .
[15] Philippe L. Toint,et al. On an instance of the inverse shortest paths problem , 1992, Math. Program..
[16] Oded Berman,et al. Improving the location of minisum facilities through network modification , 1993, Ann. Oper. Res..
[17] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[18] Didier Burton,et al. On the Inverse Shortest Path Problem , 1993 .
[19] Cynthia A. Phillips,et al. The network inhibition problem , 1993, STOC.
[20] Tomasz Radzik,et al. Parametric Flows, Weighted Means of Cuts, and Fractional Combinatorial Optimization , 1993 .
[21] Oded Berman,et al. Improving the location of minimax facilities through network modification , 1994, Networks.
[22] Philippe L. Toint,et al. On the use of an inverse shortest paths algorithm for recovering linearly correlated costs , 1994, Math. Program..
[23] Chao Yang,et al. A column generation method for inverse shortest path problems , 1995, Math. Methods Oper. Res..
[24] Jianzhon Zhang,et al. An inverse problem of the weighted shortest path problem , 1995 .
[25] Roberto Solis-Oba,et al. Increasing the weight of minimum spanning trees , 1996, SODA '96.
[26] Jianzhon Zhang,et al. Calculating some inverse linear programming problems , 1996 .
[27] Jianzhon Zhang,et al. A network flow method for solving some inverse combinatorial optimization problems , 1996 .
[28] Zhenhong Liu,et al. On the inverse problem of minimum spanning tree with partition constraints , 1996, Math. Methods Oper. Res..
[29] Sándor P. Fekete,et al. The complexity of an inverse shortest paths problem , 1997, Contemporary Trends in Discrete Mathematics.
[30] Jianzhon Zhang,et al. An algorithm for inverse minimum spanning tree problem , 1997 .
[31] Jianzhon Zhang,et al. Inverse maximum flow and minimum cut problems , 1997 .
[32] On the Use of an Inverse Shortest Paths Algorithm for Recovering Linearly Correlated Costs , 1997 .
[33] Roberto Solis-Oba,et al. Efficient algorithms for robustness in matroid optimization , 1997, SODA '97.
[34] P. Toint,et al. The inverse shortest paths problem with upper bounds on shortest paths costs , 1997 .
[35] Yanjun Li,et al. Inverse Matroid Intersection Problem , 1997, Math. Methods Oper. Res..
[36] R. Ravi,et al. Approximation Algorithms for Certain Network Improvement Problems , 1998, J. Comb. Optim..
[37] Jianzhong Zhang,et al. Inverse problem of minimum cuts , 1998, Math. Methods Oper. Res..
[38] Jianzhon Zhang,et al. Inverse maximum capacity problems , 1998 .
[39] Chao Yang,et al. A constrained capacity expansion problem on networks , 1998, Int. J. Comput. Math..
[40] Madhav V. Marathe,et al. Modifying Edges of a Network to Obtain Short Subgraphs , 1998, Theor. Comput. Sci..
[41] Zhenhong Liu,et al. A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem , 1998, Discret. Appl. Math..
[42] Jianzhon Zhang,et al. Two general methods for inverse optimization problems , 1999 .
[43] Mao-cheng Cai,et al. The Complexity Analysis of the Inverse Center Location Problem , 1999, J. Glob. Optim..
[44] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[45] Jianzhon Zhang,et al. The inverse fractional matching problem , 1999, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.
[46] Jianzhon Zhang,et al. A further study on inverse linear programming problems , 1999 .
[47] Cai Mao-cheng,et al. Inverse Problems of Matroid Intersection , 1999 .
[48] Mao-cheng Cai. Inverse Problems of Matroid Intersection , 1999, J. Comb. Optim..
[49] Yanjun Li,et al. Inverse Polymatroidal Flow Problem , 1999, J. Comb. Optim..
[50] Ravindra K. Ahuja,et al. Solving Inverse Spanning Tree Problems Through Network Flow Techniques , 1999, Oper. Res..
[51] Jianzhong Zhang,et al. Solution Structure of Some Inverse Combinatorial Optimization Problems , 1999, J. Comb. Optim..
[52] Xiaoguang Yang,et al. Reverse Center Location Problem , 1999, ISAAC.
[53] Zhenhong Liu,et al. On the inverse problem of linear programming and its application to minimum weight perfect k-matching , 1999, Eur. J. Oper. Res..
[54] Robert B. Dial,et al. Minimal-revenue congestion pricing part I: A fast algorithm for the single-origin case , 1999 .
[55] M. Cai,et al. Inverse Problems of Submodular Functions on Digraphs , 2000 .
[56] Ravindra K. Ahuja,et al. A Faster Algorithm for the Inverse Spanning Tree Problem , 2000, J. Algorithms.
[57] Jianzhong Zhang,et al. An inverse DEA model for inputs/outputs estimate , 2000, Eur. J. Oper. Res..
[58] Zhenhong Liu,et al. Some reverse location problems , 2000, Eur. J. Oper. Res..
[59] Robert B. Dial,et al. MINIMAL-REVENUE CONGESTION PRICING PART II: AN EFFICIENT ALGORITHM FOR THE GENERAL CASE , 2000 .
[60] Xiaoguang Yang,et al. Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem , 2001, RAIRO Oper. Res..
[61] Rainer E. Burkard,et al. Bottleneck Capacity Expansion Problems with General Budget Constraints , 2001, RAIRO Oper. Res..
[62] Chao Yang,et al. A class of bottleneck expansion problems , 2001, Comput. Oper. Res..
[63] Ravindra K. Ahuja,et al. Inverse Optimization , 2001, Oper. Res..
[64] Zhenhong Liu,et al. An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems , 2002, Optim. Methods Softw..
[65] Ravindra K. Ahuja,et al. Combinatorial algorithms for inverse network flow problems , 2002, Networks.
[66] Zhenhong Liu,et al. A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l∞ Norm , 2002, J. Comb. Optim..
[67] Cheng-Huang Hung. On the inverse shortest path length problem , 2003 .
[68] Dorit S. Hochbaum,et al. Efficient Algorithms for the Inverse Spanning-Tree Problem , 2003, Oper. Res..
[69] Mauro Dell'Amico,et al. The Base-matroid and Inverse Combinatorial Optimization Problems , 2003, Discret. Appl. Math..
[70] Zhenhong Liu,et al. On Inverse Problems of Optimum Perfect Matching , 2003, J. Comb. Optim..
[71] Rainer E. Burkard,et al. Inverse median problems , 2004, Discret. Optim..
[72] Rainer E. Burkard,et al. Weight reduction problems with certain bottleneck objectives , 2004, Eur. J. Oper. Res..