Connectedness of efficient solutions in multiple criteria combinatorial optimization (Q1278594): Difference between revisions

@@ Property / cites work @@
+On bicriterion minimal spanning trees: An approximation
+Normal rank
@@ Property / cites work @@
+Connectedness in Multiple Linear Fractional Programming
+Normal rank
@@ Property / cites work @@
+On matroids with multiple objectives
@@ Property / cites work: On matroids with multiple objectives / rank @@
+Normal rank
@@ Property / cites work @@
+A revised simplex method for linear multiple objective programs
+Normal rank
@@ Property / cites work @@
+A time expanded matroid algorithm for finding optimal dynamic matroid intersections
+Normal rank
@@ Property / cites work @@
+On spanning tree problems with multiple objectives
+Normal rank
@@ Property / cites work @@
+On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
+Normal rank
@@ Property / cites work @@
+The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
+Normal rank
@@ Property / cites work @@
+On a multicriteria shortest path problem
@@ Property / cites work: On a multicriteria shortest path problem / rank @@
+Normal rank
@@ Property / cites work @@
+Connectedness of the set of nondominated outcomes in multicriteria optimization
+Normal rank
@@ Property / cites work @@
+Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
+Normal rank
@@ Property / cites work @@
+Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
+Normal rank
@@ Property / cites work @@
+The set of all nondominated solutions in linear cases and a multicriteria simplex method
+Normal rank