Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197): Difference between revisions

@@ Property / author @@
+Sumit K. Garg
@@ Property / author: Sumit K. Garg / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C08
@@ Property / Mathematics Subject Classification ID: 90C08 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C57
@@ Property / Mathematics Subject Classification ID: 90C57 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C11
@@ Property / Mathematics Subject Classification ID: 90C11 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B80
@@ Property / Mathematics Subject Classification ID: 90B80 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6389160
@@ Property / zbMATH DE Number: 6389160 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+branch and bound
@@ Property / zbMATH Keywords: branch and bound / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+discrete approximation
@@ Property / zbMATH Keywords: discrete approximation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+facility location-allocation
@@ Property / zbMATH Keywords: facility location-allocation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+transportation
@@ Property / zbMATH Keywords: transportation / rank @@
+Normal rank

Revision as of 21:33, 30 June 2023