Mean value cross decomposition for nonlinear convex problems
暂无分享,去创建一个
[1] Kurt Jörnsten,et al. Solving the generalized knapsack problem with variable coefficients , 1996 .
[2] K. Holmberg. Mean value cross decomposition applied to integer programming problems , 1997 .
[3] Kaj Holmberg,et al. A production-transportation problem with stochastic demand and concave production costs , 1999, Math. Program..
[4] L. Cooper,et al. Stochastic transportation problems and other newtork related convex problems , 1977 .
[5] G. Brown. SOME NOTES ON COMPUTATION OF GAMES SOLUTIONS , 1949 .
[6] Tony J. Van Roy,et al. Cross decomposition for mixed integer programming , 1983, Math. Program..
[7] K. Holmberg. Linear mean value cross decomposition: A generalization of the Kornai-Liptak method , 1992 .
[8] J. Kornai,et al. Two-Level Planning , 1965 .
[9] L. LeBlanc. A heuristic approach for large scale discrete stochastic transportation-location problems , 1977 .
[10] K. Holmberg,et al. Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem , 2001 .
[11] Kaj Holmberg. Efficient decomposition and linearization methods for the stochastic transportation problem , 1995, Comput. Optim. Appl..
[12] J. Beasley. Lagrangean heuristics for location problems , 1993 .
[13] Brian W. Kernighan,et al. AMPL: A Modeling Language for Mathematical Programming , 1993 .
[14] J. Robinson. AN ITERATIVE METHOD OF SOLVING A GAME , 1951, Classics in Game Theory.