Valid inequalities and separation for capacitated fixed charge flow problems (Q1962074): Difference between revisions

@@ Property / cites work @@
+Network Design Using Cut Inequalities
@@ Property / cites work: Network Design Using Cut Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Strong Formulations for Multi-Item Capacitated Lot Sizing
+Normal rank
@@ Property / cites work @@
+Capacitated Network Design—Polyhedral Structure and Computation
+Normal rank
@@ Property / cites work @@
+Strong inequalities for capacitated survivable network design problems.
+Normal rank
@@ Property / cites work @@
+Valid inequalities and facets of the capacitated plant location problem
+Normal rank
@@ Property / cites work @@
+Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+Valid Linear Inequalities for Fixed Charge Problems
+Normal rank
@@ Property / cites work @@
+The complementary class of generalized flow cover inequalities
+Normal rank
@@ Property / cites work @@
+Solving Mixed Integer Programming Problems Using Automatic Reformulation
+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 / full work available at URL @@
+https://doi.org/10.1016/s0166-218x(99)00164-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1975547496
@@ Property / OpenAlex ID: W1975547496 / rank @@
+Normal rank