Scatter search for network design problem (Q817138): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10479-005-2451-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2085525077
@@ Property / OpenAlex ID: W2085525077 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
+Normal rank
@@ Property / cites work @@
+Service network design in freight transportation
@@ Property / cites work: Service network design in freight transportation / rank @@
+Normal rank
@@ Property / cites work @@
+A Simplex-Based Tabu Search Method for Capacitated Network Design
+Normal rank
@@ Property / cites work @@
+Greedy randomized adaptive search procedures
@@ Property / cites work: Greedy randomized adaptive search procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
+Normal rank
@@ Property / cites work @@
+A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem''
+Normal rank
@@ Property / cites work @@
+A dual ascent approach to the fixed-charge capacitated network design problem
+Normal rank
@@ Property / cites work @@
+Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
+Normal rank
@@ Property / cites work @@
+A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
+Normal rank
@@ Property / cites work @@
+Q5692632
@@ Property / cites work: Q5692632 / rank @@
+Normal rank
@@ Property / cites work @@
+Tailoring Benders decomposition for uncapacitated network design
+Normal rank
@@ Property / cites work @@
+Benders-and-cut algorithm for fixed-charge capacitated network design problem
+Normal rank