Pages that link to "Item:Q688927"

The following pages link to The integer \(L\)-shaped method for stochastic integer programs with complete recourse (Q688927):

Displaying 50 items.

• Dual decomposition in stochastic integer programming (Q1306366) (← links)
• Stochastic programming with simple integer recourse (Q1315421) (← links)
• Decomposition methods in stochastic programming (Q1365061) (← links)
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308) (← links)
• Convex approximations for complete integer recourse models (Q1434075) (← links)
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands (Q1579026) (← links)
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
• The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
• An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information (Q1634284) (← links)
• Resource allocation when planning for simultaneous disasters (Q1634307) (← links)
• Risk-based models for emergency shelter and exit design in buildings (Q1640053) (← links)
• A branch-and-check approach for a wind turbine maintenance scheduling problem (Q1651530) (← links)
• Vehicle routing with probabilistic capacity constraints (Q1651706) (← links)
• Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach (Q1652235) (← links)
• The probabilistic orienteering problem (Q1652250) (← links)
• Combining Benders decomposition and column generation for multi-activity tour scheduling (Q1652589) (← links)
• Reliable single allocation hub location problem under hub breakdowns (Q1652650) (← links)
• A stochastic programming approach for the optimal management of aggregated distributed energy resources (Q1652676) (← links)
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
• Stochastic last mile relief network design with resource reallocation (Q1703464) (← links)
• A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
• A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration (Q1711440) (← links)
• Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
• A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
• Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
• Solving minimum-cost shared arborescence problems (Q1751722) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
• A two-echelon stochastic facility location model for humanitarian relief logistics (Q1758057) (← links)
• Multi-service multi-facility network design under uncertainty (Q1761754) (← links)
• Risk-averse two-stage stochastic programming with an application to disaster management (Q1762003) (← links)
• Measuring and maximizing resilience of freight transportation networks (Q1762152) (← links)
• Applying the minimax criterion in stochastic recourse programs (Q1771344) (← links)
• Integration of progressive hedging and dual decomposition in stochastic integer programs (Q1785365) (← links)
• An optimality cut for mixed integer linear programs (Q1809846) (← links)
• A finite branch-and-bound algorithm for two-stage stochastic integer programs (Q1881566) (← links)
• On the expected value function of a simple integer recourse problem with random technology matrix (Q1893961) (← links)
• On structure and stability in stochastic programs with random technology matrix and complete integer recourse (Q1904660) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Fenchel decomposition for stochastic mixed-integer programming (Q1937960) (← links)
• Convex approximations for a class of mixed-integer recourse models (Q1958624) (← links)
• Higher-order total variation bounds for expectations of periodic functions and simple integer recourse approximations (Q1989720) (← links)
• A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs (Q1989733) (← links)
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy (Q1991276) (← links)
• A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables (Q2010099) (← links)
• A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract (Q2023991) (← links)
• A risk-averse approach for the planning of a hybrid energy system with conventional hydropower (Q2026961) (← links)
• An exact solution method for the TSP with drone based on decomposition (Q2026993) (← links)
• Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design (Q2027067) (← links)
• Investment effects of pricing schemes for non-convex markets (Q2029060) (← links)