Pages that link to "Item:Q688927"
From MaRDI portal
The following pages link to The integer \(L\)-shaped method for stochastic integer programs with complete recourse (Q688927):
Displaying 26 items.
- Evaluating appointment postponement in scheduling patients at a diagnostic clinic (Q6077327) (← links)
- Combining optimisation and simulation using logic-based Benders decomposition (Q6087478) (← links)
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut (Q6096622) (← links)
- Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach (Q6099458) (← links)
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries (Q6102745) (← links)
- Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut (Q6106761) (← links)
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)
- Optimizing integrated aircraft assignment and turnaround handling (Q6113450) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
- A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty (Q6114962) (← links)
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions (Q6126651) (← links)
- Trajectory following dynamic programming algorithms without finite support assumptions (Q6137271) (← links)
- The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands (Q6161273) (← links)
- An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup (Q6164581) (← links)
- A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem (Q6164623) (← links)
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands (Q6167539) (← links)
- Stable annual scheduling of medical residents using prioritized multiple training schedules to combat operational uncertainty (Q6167875) (← links)
- Mathematical programming formulations for the collapsed k-core problem (Q6168587) (← links)
- Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set (Q6179697) (← links)
- Decomposition methods for global solution of mixed-integer linear programs (Q6490313) (← links)
- Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs (Q6551136) (← links)
- Fleet \& tail assignment under uncertainty (Q6564190) (← links)
- Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems (Q6572838) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q6589754) (← links)
- A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning (Q6599068) (← links)
- Nested benders decomposition for a deterministic biomass feedstock logistics problem (Q6667706) (← links)
