Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (Q408396): Difference between revisions

@@ Property / author @@
-Mu-Hong Zhang
@@ Property / author: Mu-Hong Zhang / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C11
@@ Property / Mathematics Subject Classification ID: 90C11 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C47
@@ Property / Mathematics Subject Classification ID: 90C47 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C60
@@ Property / Mathematics Subject Classification ID: 90C60 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6022228
@@ Property / zbMATH DE Number: 6022228 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lot-sizing
@@ Property / zbMATH Keywords: lot-sizing / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimax regret
@@ Property / zbMATH Keywords: minimax regret / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+mixed integer programming
@@ Property / zbMATH Keywords: mixed integer programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+robust optimization
@@ Property / zbMATH Keywords: robust optimization / rank @@
+Normal rank
@@ Property / author @@
+Mu-Hong Zhang
@@ Property / author: Mu-Hong Zhang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2011.06.013
+Normal rank
@@ Property / OpenAlex ID @@
+W1965056266
@@ Property / OpenAlex ID: W1965056266 / rank @@
+Normal rank
@@ Property / cites work @@
+Min-max and min-max regret versions of combinatorial optimization problems: A survey
+Normal rank
@@ Property / cites work @@
+Two-Stage Robust Network Flow and Design Under Demand Uncertainty
+Normal rank
@@ Property / cites work @@
+Minmax regret solutions for minimax optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+The minmax regret permutation flow-shop problem with two jobs
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+Adjustable robust solutions of uncertain linear programs
+Normal rank
@@ Property / cites work @@
+Robust solutions of linear programming problems contaminated with uncertain data
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and network flows
@@ Property / cites work: Robust discrete optimization and network flows / rank @@
+Normal rank
@@ Property / cites work @@
+The Price of Robustness
@@ Property / cites work: The Price of Robustness / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
+Normal rank
@@ Property / cites work @@
+Dynamic Version of the Economic Lot Size Model
@@ Property / cites work: Dynamic Version of the Economic Lot Size Model / rank @@
+Normal rank
@@ Property / cites work @@
+Q4054818
@@ Property / cites work: Q4054818 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:408396