Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563): Difference between revisions

@@ Property / cites work @@
+On splittable and unsplittable flow capacitated network design arc-set polyhedra.
+Normal rank
@@ Property / cites work @@
+Facets of the knapsack polytope
@@ Property / cites work: Facets of the knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Network Design Using Cut Inequalities
@@ Property / cites work: Network Design Using Cut Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(k\)-cut problem
@@ Property / cites work: On the \(k\)-cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cost capacity installation for multicommodity network flows
+Normal rank
@@ Property / cites work @@
+Capacitated Network Design—Polyhedral Structure and Computation
+Normal rank
@@ Property / cites work @@
+Backbone Network Design Tools with Economic Tradeoffs
+Normal rank
@@ Property / cites work @@
+Polyhedral results for the edge capacity polytope.
+Normal rank
@@ Property / cites work @@
+The convex hull of two core capacitated network design problems
+Normal rank
@@ Property / cites work @@
+Modeling and Solving the Two-Facility Capacitated Network Loading Problem
+Normal rank
@@ Property / cites work @@
+Technical Note—A Note on Zero-One Programming
@@ Property / cites work: Technical Note—A Note on Zero-One Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Faces for a linear inequality in 0–1 variables
@@ Property / cites work: Faces for a linear inequality in 0–1 variables / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0166-218x(03)00436-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1991826887
@@ Property / OpenAlex ID: W1991826887 / rank @@
+Normal rank