Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem (Q1171987): Difference between revisions

@@ Property / cites work @@
+An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
+Normal rank
@@ Property / cites work @@
+Q4139967
@@ Property / cites work: Q4139967 / rank @@
+Normal rank
@@ Property / cites work @@
+A tree search algorithm for the p-median problem
@@ Property / cites work: A tree search algorithm for the p-median problem / rank @@
+Normal rank
@@ Property / cites work @@
+A branch‐bound algorithm for the capacitated facilities location problem
+Normal rank
@@ Property / cites work @@
+A Dual-Based Procedure for Uncapacitated Facility Location
+Normal rank
@@ Property / cites work @@
+A direct dual method for the mixed plant location problem with some side constraints
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Algorithm for the Capacitated Facility Location Problem
+Normal rank
@@ Property / cites work @@
+A Branch and Bound Algorithm for the p-Median Transportation Problem
+Normal rank
@@ Property / cites work @@
+Modeling Facility Location Problems as Generalized Assignment Problems
+Normal rank
@@ Property / cites work @@
+A Cross Decomposition Algorithm for Capacitated Facility Location
+Normal rank
@@ Property / cites work @@
+Cross decomposition for mixed integer programming
@@ Property / cites work: Cross decomposition for mixed integer programming / rank @@
+Normal rank