Metric inequalities and the network loading problem (Q2471279): Difference between revisions

@@ Property / author @@
-Pasquale Avella
@@ Property / author: Pasquale Avella / rank @@
-Normal rank
@@ Property / author @@
+Pasquale Avella
@@ Property / author: Pasquale Avella / 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.1016/j.disopt.2006.10.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1968016922
@@ Property / OpenAlex ID: W1968016922 / 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 @@
+Q4398375
@@ Property / cites work: Q4398375 / 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 @@
+Potential function methods for approximately solving linear programming problems: theory and practice.
+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 @@
+\(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
@@ Property / cites work: \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts / rank @@
+Normal rank
@@ Property / cites work @@
+On the separation of maximally violated mod-\(k\) cuts
+Normal rank
@@ Property / cites work @@
+Source sink flows with capacity installation in batches
+Normal rank
@@ Property / cites work @@
+Q4371290
@@ Property / cites work: Q4371290 / rank @@
+Normal rank
@@ Property / cites work @@
+Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
+Normal rank
@@ Property / cites work @@
+A Simplex-Based Tabu Search Method for Capacitated Network Design
+Normal rank
@@ Property / cites work @@
+Geometry of cuts and metrics
@@ Property / cites work: Geometry of cuts and metrics / rank @@
+Normal rank
@@ Property / cites work @@
+On the membership problem for the elementary closure of a polyhedron
+Normal rank
@@ Property / cites work @@
+Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for capacitated network design problems
+Normal rank
@@ Property / cites work @@
+A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
+Normal rank
@@ Property / cites work @@
+Q5629416
@@ Property / cites work: Q5629416 / rank @@
+Normal rank
@@ Property / cites work @@
+Totally tight Chvatal-Gomory cuts
@@ Property / cites work: Totally tight Chvatal-Gomory cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234145
@@ Property / cites work: Q4234145 / rank @@
+Normal rank
@@ Property / cites work @@
+Modeling and Solving the Two-Facility Capacitated Network Loading Problem
+Normal rank
@@ Property / cites work @@
+A polyhedral approach to multicommodity survivable network design
+Normal rank