Pages that link to "Item:Q2502208"

The following pages link to Solving a class of stochastic mixed-integer programs with branch and price (Q2502208):

Displaying 11 items.

• The stochastic capacitated branch restructuring problem (Q512982) (← links)
• Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints (Q828768) (← links)
• Developing work schedules for an inter-city transit system with multiple driver types and fleet types (Q1011229) (← links)
• The stochastic interdiction median problem with disruption intensity levels (Q1945089) (← links)
• Convex approximations for a class of mixed-integer recourse models (Q1958624) (← links)
• A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs (Q1989733) (← links)
• On bridging the gap between stochastic integer programming and MIP solver technologies (Q2890409) (← links)
• A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems (Q3114905) (← links)
• Branch and Price for Chance-Constrained Bin Packing (Q3386782) (← links)
• (Q3727719) (← links)
• A branch‐and‐price approach for the stochastic generalized assignment problem (Q4632825) (← links)