Weighting factor extensions for finite multiple objective vector minimization problems
暂无分享,去创建一个
[1] K. Swarup,et al. Extreme Point Mathematical Programming , 1972 .
[2] R. Prim. Shortest connection networks and some generalizations , 1957 .
[3] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[4] Ralph E. Steuer,et al. A revised simplex method for linear multiple objective programs , 1973, Math. Program..
[5] Toshihide Ibaraki,et al. An Algorithm for Finding K Minimum Spanning Trees , 1981, SIAM J. Comput..
[6] Yash P. Aneja,et al. Minimal spanning tree subject to a side constraint , 1982, Comput. Oper. Res..
[7] D. White. Optimality and efficiency , 1982 .
[8] A. S. Harding. Markovian decision processes , 1970 .
[9] J. E. van Aken. Approches systémiques des organisations: vers l'entreprise à complexité humaine: Jacques MÉLÈSE Hommes et Techniques, Suresnes, 1979, 158 pages, FF 116 , 1981 .
[10] Harold N. Gabow,et al. Two Algorithms for Generating Weighted Spanning Trees in Order , 1977, SIAM J. Comput..
[11] D. J. White,et al. The set of efficient solutions for multiple objective shortest path problems , 1982, Comput. Oper. Res..
[12] M. Zeleny. Linear Multiobjective Programming , 1974 .
[13] H. Joksch. The shortest route problem with constraints , 1966 .
[14] T. A. Bray,et al. OPTIMUM REDUNDANCY UNDER MULTIPLE CONSTRAINTS , 1965 .
[15] George B. Dantzig,et al. Linear programming and extensions , 1965 .