On cut-based inequalities for capacitated network design polyhedra (Q3082603): Difference between revisions

@@ Property / DOI @@
-.1002/net.20395
@@ Property / DOI: 10.1002/net.20395 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20395
@@ Property / full work available at URL: https://doi.org/10.1002/net.20395 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2013920518
@@ Property / OpenAlex ID: W2013920518 / rank @@
+Normal rank
@@ Property / cites work @@
+k-Partition-based facets of the network design problem
+Normal rank
@@ Property / cites work @@
+Flow pack facets of the single node fixed-charge flow polytope
+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 the facets of the mixed-integer knapsack polyhedron
+Normal rank
@@ Property / cites work @@
+On splittable and unsplittable flow capacitated network design arc-set polyhedra.
+Normal rank
@@ Property / cites work @@
+Metric inequalities and the network loading problem
+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 @@
+Minimum cost capacity installation for multicommodity network flows
+Normal rank
@@ Property / cites work @@
+Source sink flows with capacity installation in batches
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for capacitated network design problems
+Normal rank
@@ Property / cites work @@
+Polyhedral results for the edge capacity polytope.
+Normal rank
@@ Property / cites work @@
+Q5629416
@@ Property / cites work: Q5629416 / rank @@
+Normal rank
@@ Property / cites work @@
+Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
+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 @@
+Aggregation and Mixed Integer Rounding to Solve MIPs
+Normal rank
@@ Property / cites work @@
+A recursive procedure to generate all cuts for 0-1 mixed integer programs
+Normal rank
@@ Property / cites work @@
+Valid Linear Inequalities for Fixed Charge Problems
+Normal rank
@@ Property / cites work @@
+On cut-based inequalities for capacitated network design polyhedra
+Normal rank
@@ Property / cites work @@
+The complementary class of generalized flow cover inequalities
+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 / DOI @@
+.1002/NET.20395
@@ Property / DOI: 10.1002/NET.20395 / rank @@
+Normal rank