Valid inequalities and facets for multi‐module survivable network design problem (Q6179709): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.22122
@@ Property / full work available at URL: https://doi.org/10.1002/net.22122 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4293215694
@@ Property / OpenAlex ID: W4293215694 / 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 @@
+\(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
+Normal rank
@@ Property / cites work @@
+Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
+Normal rank
@@ Property / cites work @@
+Telecommunication link restoration planning with multiple facility types
+Normal rank
@@ Property / cites work @@
+\(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
+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 @@
+SONET/SDH ring assignment with capacity constraints
+Normal rank
@@ Property / cites work @@
+Q4845372
@@ Property / cites work: Q4845372 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5294060
@@ Property / cites work: Q5294060 / 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 @@
+Design of Survivable Networks: A survey
@@ Property / cites work: Design of Survivable Networks: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
+Normal rank
@@ Property / cites work @@
+Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
+Normal rank
@@ Property / cites work @@
+Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
+Normal rank
@@ Property / cites work @@
+Shortest paths, single origin‐destination network design, and associated polyhedra
+Normal rank
@@ Property / cites work @@
+Modeling and Solving the Two-Facility Capacitated Network Loading Problem
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for finding a fundamental set of cycles of a graph
+Normal rank
@@ Property / cites work @@
+On cut-based inequalities for capacitated network design polyhedra
+Normal rank
@@ Property / cites work @@
+A directed cycle-based column-and-cut generation method for capacitated survivable network design
+Normal rank
@@ Property / cites work @@
+Solving the Capacitated Local Access Network Design Problem
+Normal rank
@@ Property / cites work @@
+Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
+Normal rank
@@ Property / cites work @@
+A polyhedral approach to multicommodity survivable network design
+Normal rank
@@ Property / cites work @@
+Q4254875
@@ Property / cites work: Q4254875 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6179709