A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty (Q322919): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B06
@@ Property / Mathematics Subject Classification ID: 90B06 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C11
@@ Property / Mathematics Subject Classification ID: 90C11 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C15
@@ Property / Mathematics Subject Classification ID: 90C15 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6636234
@@ Property / zbMATH DE Number: 6636234 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+multi-stage stochastic programming
@@ Property / zbMATH Keywords: multi-stage stochastic programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scenario decomposition
@@ Property / zbMATH Keywords: scenario decomposition / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Lagrangian relaxation
@@ Property / zbMATH Keywords: Lagrangian relaxation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sub-gradient method
@@ Property / zbMATH Keywords: sub-gradient method / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+variable fixing heuristic
@@ Property / zbMATH Keywords: variable fixing heuristic / rank @@
+Normal rank

Revision as of 03:20, 28 June 2023