Connectedness of efficient solutions in multiple criteria combinatorial optimization
暂无分享，去创建一个
[1] Ralph E. Steuer,et al. A revised simplex method for linear multiple objective programs , 1973, Math. Program..
[2] P. Yu. Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives , 1974 .
[3] Joseph G. Ecker,et al. Finding efficient points for linear multiple objective programs , 1975, Math. Program..
[4] P. Yu,et al. The set of all nondominated solutions in linear cases and a multicriteria simplex method , 1975 .
[5] Heinz Isermann,et al. The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program , 1977 .
[6] P. Naccache,et al. Connectedness of the set of nondominated outcomes in multicriteria optimization , 1978 .
[7] E. Choo,et al. Connectedness in Multiple Linear Fractional Programming , 1983 .
[8] A. Warburton. Quasiconcave vector maximization: Connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives , 1983 .
[9] E. Martins. On a multicriteria shortest path problem , 1984 .
[10] S. Helbig,et al. On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces , 1990 .
[11] Horst W. Hamacher,et al. On spanning tree problems with multiple objectives , 1994, Ann. Oper. Res..
[12] Mikael Lind,et al. On bicriterion minimal spanning trees: An approximation , 1996, Comput. Oper. Res..
[13] E. Ehrgott. On matroids with multiple objectives , 1996 .