Distances between optimal solutions of mixed-integer programs (Q2288201): Difference between revisions

@@ Property / cites work @@
+Refined proximity and sensitivity results in linearly constrained convex separable integer programming
+Normal rank
@@ Property / cites work @@
+The value function of a mixed integer program: I
@@ Property / cites work: The value function of a mixed integer program: I / rank @@
+Normal rank
@@ Property / cites work @@
+The value function of a mixed integer program. II
@@ Property / cites work: The value function of a mixed integer program. II / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming
@@ Property / cites work: Integer Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Sensitivity theorems in integer linear programming
+Normal rank
@@ Property / cites work @@
+Q4607934
@@ Property / cites work: Q4607934 / rank @@
+Normal rank
@@ Property / cites work @@
+Some proximity and sensitivity results in quadratic integer programming
+Normal rank
@@ Property / cites work @@
+Convex separable optimization is not much harder than linear optimization
+Normal rank
@@ Property / cites work @@
+A combinatorial problem on finite Abelian groups. I
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer program with bimodular matrix
@@ Property / cites work: Integer program with bimodular matrix / rank @@
+Normal rank
@@ Property / cites work @@
+The relationship between integer and real solutions of constrained convex programming
+Normal rank