A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297): Difference between revisions

@@ Property / cites work @@
+A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
+Normal rank
@@ Property / cites work @@
+Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
+Normal rank
@@ Property / cites work @@
+A survey on Benders decomposition applied to fixed-charge network design problems
+Normal rank
@@ Property / cites work @@
+Capacitated Network Design—Polyhedral Structure and Computation
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for capacitated network design problems
+Normal rank
@@ Property / cites work @@
+A Simplex-Based Tabu Search Method for Capacitated Network Design
+Normal rank
@@ Property / cites work @@
+Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
+Normal rank
@@ Property / cites work @@
+Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
+Normal rank
@@ Property / cites work @@
+A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
+Normal rank
@@ Property / cites work @@
+A first multilevel cooperative algorithm for capacitated multicommodity network design
+Normal rank
@@ Property / cites work @@
+Local branching
@@ Property / cites work: Local branching / rank @@
+Normal rank
@@ Property / cites work @@
+A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search and local branching
@@ Property / cites work: Variable neighborhood search and local branching / rank @@
+Normal rank