Complete formulations of polytopes related to extensions of assignment matrices (Q1662654): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2018.04.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2801998034
@@ Property / OpenAlex ID: W2801998034 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258215
@@ Property / cites work: Q4258215 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
+Normal rank
@@ Property / cites work @@
+Exact and Approximate Algorithms for Scheduling Nonidentical Processors
+Normal rank
@@ Property / cites work @@
+On the Most Imbalanced Orientation of a Graph
@@ Property / cites work: On the Most Imbalanced Orientation of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Extended and discretized formulations for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Disjunctive programming: Properties of the convex hull of feasible points
+Normal rank