Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2007.08.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2151727533
@@ Property / OpenAlex ID: W2151727533 / rank @@
+Normal rank
@@ Property / cites work @@
+Cost-efficient network synthesis from leased lines
+Normal rank
@@ Property / cites work @@
+Topological design of ring networks
@@ Property / cites work: Topological design of ring networks / rank @@
+Normal rank
@@ Property / cites work @@
+On capacitated network design cut-set polyhedra
@@ Property / cites work: On capacitated network design cut-set polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+On splittable and unsplittable flow capacitated network design arc-set polyhedra.
+Normal rank
@@ Property / cites work @@
+Integer Programming and Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Q4398375
@@ Property / cites work: Q4398375 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity-splitting models for survivable network design
+Normal rank
@@ Property / cites work @@
+Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type
+Normal rank
@@ Property / cites work @@
+Network Design Using Cut Inequalities
@@ Property / cites work: Network Design Using Cut Inequalities / rank @@
+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 @@
+Source sink flows with capacity installation in batches
+Normal rank
@@ Property / cites work @@
+Linear Programming under Uncertainty
@@ Property / cites work: Linear Programming under Uncertainty / rank @@
+Normal rank
@@ Property / cites work @@
+SONET/SDH ring assignment with capacity constraints
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for capacitated network design problems
+Normal rank
@@ Property / cites work @@
+Q5629416
@@ Property / cites work: Q5629416 / rank @@
+Normal rank
@@ Property / cites work @@
+The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis
+Normal rank
@@ Property / cites work @@
+Shortest paths, single origin‐destination network design, and associated polyhedra
+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 @@
+Strong formulations for network design problems with connectivity requirements
+Normal rank
@@ Property / cites work @@
+A recursive procedure to generate all cuts for 0-1 mixed integer programs
+Normal rank
@@ Property / cites work @@
+A directed cycle-based column-and-cut generation method for capacitated survivable network design
+Normal rank
@@ Property / cites work @@
+Bidirected and unidirected capacity installation in telecommunication networks.
+Normal rank
@@ Property / cites work @@
+Q4254875
@@ Property / cites work: Q4254875 / rank @@
+Normal rank