Theory and algorithms for linear multiple objective programs with zero–one variables (Q3853460): Difference between revisions

@@ Property / cites work @@
+Linear multiple objective programs with zero–one variables
+Normal rank
@@ Property / cites work @@
+Finding all efficient extreme points for multiple objective linear programs
+Normal rank
@@ Property / cites work @@
+A revised simplex method for linear multiple objective programs
+Normal rank
@@ Property / cites work @@
+Q5589748
@@ Property / cites work: Q5589748 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3214697
@@ Property / cites work: Q3214697 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the vector maximization problem
@@ Property / cites work: Algorithms for the vector maximization problem / rank @@
+Normal rank
@@ Property / cites work @@
+Convex Analysis
@@ Property / cites work: Convex Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+The set of all nondominated solutions in linear cases and a multicriteria simplex method
+Normal rank
@@ Property / cites work @@
+Identifying Efficient Vectors: Some Theory and Computational Results
+Normal rank
@@ Property / cites work @@
+Q4138487
@@ Property / cites work: Q4138487 / rank @@
+Normal rank