Some efficiently solvable problems over integer partition polytopes (Q476314): Difference between revisions

@@ Property / cites work @@
+Q4146776
@@ Property / cites work: Q4146776 / rank @@
+Normal rank
@@ Property / cites work @@
+Large sparse numerical optimization
@@ Property / cites work: Large sparse numerical optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal integer partitions
@@ Property / cites work: Optimal integer partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization.
+Normal rank
@@ Property / cites work @@
+Q3236252
@@ Property / cites work: Q3236252 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Polyhedral Characterization of Discrete Dynamic Programming
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm, based on Newton's method, for linear programming
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Polyhedral proof methods in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Polytopes of partitions of numbers
@@ Property / cites work: Polytopes of partitions of numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Q2875896
@@ Property / cites work: Q2875896 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2732561
@@ Property / cites work: Q2732561 / rank @@
+Normal rank