Pages that link to "Item:Q1708524"
From MaRDI portal
The following pages link to A polyhedral study of the static probabilistic lot-sizing problem (Q1708524):
Displaying 12 items.
- Lot-sizing polyhedra with a cardinality constraint (Q1198618) (← links)
- A perfect information lower bound for robust lot-sizing problems (Q1730584) (← links)
- Polyhedra for lot-sizing with Wagner-Whitin costs (Q1804648) (← links)
- A study of the lot-sizing polytope (Q1881043) (← links)
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
- On intersection of two mixing sets with applications to joint chance-constrained programs (Q2414899) (← links)
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem (Q2583144) (← links)
- Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems (Q3392239) (← links)
- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging (Q3503865) (← links)
- Probabilistic Partial Set Covering with an Oracle for Chance Constraints (Q4629339) (← links)
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem (Q6038656) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
