Minimum cost capacity installation for multicommodity network flows (Q1290614): Difference between revisions

@@ Property / author @@
+Bienstock, Daniel
@@ Property / author: Bienstock, Daniel / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / 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 @@
+Capacitated Network Design—Polyhedral Structure and Computation
+Normal rank
@@ Property / cites work @@
+Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
+Normal rank
@@ Property / cites work @@
+Computational experience with a difficult mixed-integer multicommodity flow problem
+Normal rank
@@ Property / cites work @@
+Minimum cost capacity installation for multicommodity network flows
+Normal rank
@@ Property / cites work @@
+Solving Airline Crew Scheduling Problems by Branch-and-Cut
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
+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
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01581104
+Normal rank
@@ Property / OpenAlex ID @@
+W2051290577
@@ Property / OpenAlex ID: W2051290577 / rank @@
+Normal rank