Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
From MaRDI portal
(Redirected from Publication:408396)
Recommendations
- Robust inventory problem with budgeted cumulative demand uncertainty
- Production planning under demand uncertainty: a budgeted uncertainty approach
- The robust multi-plant capacitated lot-sizing problem
- Min-max regret robust optimization approach on interval data uncertainty
- A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches
Cites work
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Adjustable robust solutions of uncertain linear programs
- Dynamic version of the economic lot size model
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Interval data minmax regret network optimization problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minmax regret solutions for minimax optimization problems with uncertainty
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- The Price of Robustness
- The minmax regret permutation flow-shop problem with two jobs
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Cited in
(17)- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
- Robust inventory control under demand and lead time uncertainty
- Robust optimization for lot-sizing problems under yield uncertainty
- Single-item dynamic lot-sizing problems: an updated survey
- Lot sizing with storage losses under demand uncertainty
- On robust lot sizing problems with storage deterioration, with applications to heat and power cogeneration
- The robust multi-plant capacitated lot-sizing problem
- Recent advances in robust optimization: an overview
- Two-stage stochastic lot-sizing problem under cost uncertainty
- Home health care facility location problem under demand uncertainty
- Comparison of different approaches to multistage lot sizing with uncertain demand
- Adjustable robust optimization reformulations of two-stage worst-case regret minimization problems
- Two-stage robust mixed integer programming problem with objective uncertainty
- Min-max regret robust optimization approach on interval data uncertainty
- Robust inventory problem with budgeted cumulative demand uncertainty
- Robust postdonation blood screening under prevalence rate uncertainty
- A robust model for the lot-sizing problem with uncertain demands
This page was built for publication: Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408396)