Pages that link to "Item:Q323187"
From MaRDI portal
The following pages link to Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic (Q323187):
Displaying 15 items.
- New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty (Q1628038) (← links)
- A generalized bin packing problem for parcel delivery in last-mile logistics (Q1755394) (← links)
- A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches (Q1789611) (← links)
- Scheduled service network design with quality targets and stochastic travel times (Q2028837) (← links)
- Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
- A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times (Q2148147) (← links)
- The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities (Q2191290) (← links)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
- Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
- Cutting and packing problems under uncertainty: literature review and classification framework (Q6056892) (← links)
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands (Q6060670) (← links)
- A machine learning optimization approach for last-mile delivery and third-party logistics (Q6106567) (← links)
- Stochastic forestry planning under market and growth uncertainty (Q6164380) (← links)