A note on capacity models for network design (Q2417179): Difference between revisions

@@ Property / author @@
-Atamtürk, Alper
@@ Property / author: Atamtürk, Alper / rank @@
-Normal rank
@@ Property / author @@
-Oktay Günlük
@@ Property / author: Oktay Günlük / rank @@
-Normal rank
@@ Property / author @@
+Atamtürk, Alper
@@ Property / author: Atamtürk, Alper / rank @@
+Normal rank
@@ Property / author @@
+Oktay Günlük
@@ Property / author: Oktay Günlük / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2804192059
@@ Property / OpenAlex ID: W2804192059 / rank @@
+Normal rank
@@ Property / cites work @@
+The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
+Normal rank
@@ Property / cites work @@
+k-Partition-based facets of the network design problem
+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 @@
+Network design arc set with variable upper bounds
@@ Property / cites work: Network design arc set with variable upper bounds / rank @@
+Normal rank
@@ Property / cites work @@
+On splittable and unsplittable flow capacitated network design arc-set polyhedra.
+Normal rank
@@ Property / cites work @@
+Valid inequalities for problems with additive variable upper bounds
+Normal rank
@@ Property / cites work @@
+Capacitated Network Design—Polyhedral Structure and Computation
+Normal rank
@@ Property / cites work @@
+Minimum cost capacity installation for multicommodity network flows
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for capacitated network design problems
+Normal rank
@@ Property / cites work @@
+Solving the two‐facility network design problem with 3‐partition facets
+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 @@
+Projections of the capacitated network loading problem
+Normal rank
@@ Property / cites work @@
+Domination Between Traffic Matrices
@@ Property / cites work: Domination Between Traffic Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+On cut-based inequalities for capacitated network design polyhedra
+Normal rank