A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343): Difference between revisions

@@ Property / cites work @@
+MIP Modeling of Incremental Connected Facility Location
+Normal rank
@@ Property / cites work @@
+Network Design Using Cut Inequalities
@@ Property / cites work: Network Design Using Cut Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu search for a network loading problem with multiple facilities
+Normal rank
@@ Property / cites work @@
+-1 reformulations of the multicommodity capacitated network design problem
+Normal rank
@@ Property / cites work @@
+A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
+Normal rank
@@ Property / cites work @@
+MIP models for connected facility location: a theoretical and computational study
+Normal rank
@@ Property / cites work @@
+Separation algorithms for 0-1 knapsack polytopes
@@ Property / cites work: Separation algorithms for 0-1 knapsack polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+A splitter location-allocation problem in designing fiber optic access networks
+Normal rank
@@ Property / cites work @@
+Branch-and-cut-and-price for capacitated connected facility location
+Normal rank
@@ Property / cites work @@
+A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem
+Normal rank
@@ Property / cites work @@
+Exact approaches to the single-source network loading problem
+Normal rank
@@ Property / cites work @@
+Solving the Capacitated Local Access Network Design Problem
+Normal rank