Pages that link to "Item:Q5739131"

The following pages link to Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse (Q5739131):

Displaying 34 items.

• Cutting planes from extended LP formulations (Q507316) (← links)
• Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage (Q827111) (← links)
• Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
• A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• A new lift-and-project operator (Q1752818) (← links)
• New solution approaches for the maximum-reliability stochastic network interdiction problem (Q1989731) (← links)
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
• An L-shaped method with strengthened lift-and-project cuts (Q2109005) (← links)
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
• Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk (Q2189450) (← links)
• Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs (Q2231326) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse (Q2288987) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (Q2414914) (← links)
• Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty (Q3387962) (← links)
• Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs (Q4609472) (← links)
• Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems (Q4637497) (← links)
• Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming (Q4641662) (← links)
• Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
• Multicomponent Maintenance Optimization: A Stochastic Programming Approach (Q5085464) (← links)
• On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs (Q5106425) (← links)
• Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)
• The Benders Dual Decomposition Method (Q5130513) (← links)
• Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs (Q5139855) (← links)
• Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
• Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems (Q6066721) (← links)
• A survey on bilevel optimization under uncertainty (Q6096565) (← links)
• Uncertainty in maritime ship routing and scheduling: a literature review (Q6112538) (← links)
• A study of progressive hedging for stochastic integer programming (Q6187184) (← links)
• Decomposition methods for global solution of mixed-integer linear programs (Q6490313) (← links)