Lifted Euclidean inequalities for the integer single node flow set with upper bounds (Q322621): Difference between revisions

@@ Property / OpenAlex ID @@
+W1831708085
@@ Property / OpenAlex ID: W1831708085 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57736487
@@ Property / Wikidata QID: Q57736487 / rank @@
+Normal rank
@@ Property / cites work @@
+Description of 2-integer continuous knapsack polyhedra
+Normal rank
@@ Property / cites work @@
+Polyhedral description of the integer single node flow set with constant bounds
+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 @@
+Lower Bounds in Lot-Sizing Models: A Polyhedral Study
+Normal rank
@@ Property / cites work @@
+Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
+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 @@
+Valid Linear Inequalities for Fixed Charge Problems
+Normal rank
@@ Property / cites work @@
+Valid inequalities for mixed 0-1 programs
@@ Property / cites work: Valid inequalities for mixed 0-1 programs / rank @@
+Normal rank
@@ Property / cites work @@
+The complementary class of generalized flow cover inequalities
+Normal rank