Valid inequalities for the single arc design problem with set-ups (Q1751105): Difference between revisions

@@ Property / cites work @@
+Valid Linear Inequalities for Fixed Charge Problems
+Normal rank
@@ Property / cites work @@
+The convex hull of two core capacitated network design problems
+Normal rank
@@ Property / cites work @@
+Production Planning by Mixed Integer Programming
@@ Property / cites work: Production Planning by Mixed Integer Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A polyhedral study of lot-sizing with supplier selection
+Normal rank
@@ Property / cites work @@
+Facets for the single node fixed-charge network set with a node set-up variable
+Normal rank
@@ Property / cites work @@
+Using separation algorithms to generate mixed integer model reformulations
+Normal rank
@@ Property / cites work @@
+Capacitated Facility Location: Valid Inequalities and Facets
+Normal rank
@@ Property / cites work @@
+Disjunctive programming: Properties of the convex hull of feasible points
+Normal rank
@@ Property / cites work @@
+Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Graph Theory and Integer Programming
@@ Property / cites work: Graph Theory and Integer Programming / rank @@
+Normal rank