A branch-and-bound method for multicommodity location with balancing requirements (Q1804068): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(93)90117-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2090983252
@@ Property / OpenAlex ID: W2090983252 / rank @@
+Normal rank
@@ Property / cites work @@
+Facility location models for distribution planning
+Normal rank
@@ Property / cites work @@
+Models for multimode multicommodity location problems with interdepot balancing requirements
+Normal rank
@@ Property / cites work @@
+A branch-and-bound method for multicommodity location with balancing requirements
+Normal rank
@@ Property / cites work @@
+Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
+Normal rank
@@ Property / cites work @@
+A Dual-Based Procedure for Uncapacitated Facility Location
+Normal rank
@@ Property / cites work @@
+An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
+Normal rank
@@ Property / cites work @@
+Optimal and heuristic algorithms for multiproduct uncapacitated facility location
+Normal rank
@@ Property / cites work @@
+A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
+Normal rank
@@ Property / cites work @@
+The simple plant location problem: Survey and synthesis
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank