The integer \(L\)-shaped method for stochastic integer programs with complete recourse

DOI10.1016/0167-6377(93)90002-XzbMath0793.90043MaRDI QIDQ688927

François V. Louveaux, Gilbert Laporte

Publication date: 1 November 1993

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

\(L\)-shaped methodbranch-and-cut procedurecomplete recoursestochastic integer programs

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15)

Related Items (only showing first 100 items - show all)

A two-step stochastic approach for operating rooms scheduling in multi-resource environment ⋮ Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage ⋮ The stochastic opportunistic replacement problem. III: Improved bounding procedures ⋮ Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs ⋮ Cutting planes for the multistage stochastic unit commitment problem ⋮ Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints ⋮ The \(p\)-arborescence star problem: formulations and exact solution approaches ⋮ A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming ⋮ An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information ⋮ Resource allocation when planning for simultaneous disasters ⋮ On the expected value function of a simple integer recourse problem with random technology matrix ⋮ Risk-based models for emergency shelter and exit design in buildings ⋮ Satisficing measure approach for vehicle routing problem with time windows under uncertainty ⋮ A generic stochastic model for supply-and-return network design ⋮ Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals ⋮ Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation ⋮ Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption ⋮ Evaluating and optimizing resilience of airport pavement networks ⋮ A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands ⋮ A branch-and-price approach for a multi-period vehicle routing problem ⋮ A branch-and-check approach for a wind turbine maintenance scheduling problem ⋮ On structure and stability in stochastic programs with random technology matrix and complete integer recourse ⋮ Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure ⋮ Vehicle routing with probabilistic capacity constraints ⋮ Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach ⋮ The probabilistic orienteering problem ⋮ Combining Benders decomposition and column generation for multi-activity tour scheduling ⋮ Reliable single allocation hub location problem under hub breakdowns ⋮ A stochastic programming approach for the optimal management of aggregated distributed energy resources ⋮ Two-stage stochastic programming supply chain model for biodiesel production via wastewater treatment ⋮ Stochastic programming analysis and solutions to schedule overcrowded operating rooms in China ⋮ A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands ⋮ Decomposition methods in stochastic programming ⋮ Routing problems: A bibliography ⋮ Solving a generalized traveling salesperson problem with stochastic customers ⋮ On a stochastic sequencing and scheduling problem ⋮ On the enrouting protocol problem under uncertainty ⋮ Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning ⋮ Partial-route inequalities for the multi-vehicle routing problem with stochastic demands ⋮ Fenchel decomposition for stochastic mixed-integer programming ⋮ BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. ⋮ Stochastic last mile relief network design with resource reallocation ⋮ A polyhedral study of the static probabilistic lot-sizing problem ⋮ A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration ⋮ Convex approximations for a class of mixed-integer recourse models ⋮ Convex approximations for complete integer recourse models ⋮ The stop-and-drop problem in nonprofit food distribution networks ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs ⋮ Almost robust discrete optimization ⋮ A two-stage stochastic programming approach for influence maximization in social networks ⋮ Decomposition methods for the two-stage stochastic Steiner tree problem ⋮ Higher-order total variation bounds for expectations of periodic functions and simple integer recourse approximations ⋮ A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs ⋮ Minimizing value-at-risk in single-machine scheduling ⋮ Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios ⋮ An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy ⋮ Solving minimum-cost shared arborescence problems ⋮ The Benders decomposition algorithm: a literature review ⋮ Stochastic survivable network design problems: theory and practice ⋮ A two-echelon stochastic facility location model for humanitarian relief logistics ⋮ Multi-service multi-facility network design under uncertainty ⋮ Risk-averse two-stage stochastic programming with an application to disaster management ⋮ Measuring and maximizing resilience of freight transportation networks ⋮ An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays ⋮ Allocation and scheduling of conditional task graphs ⋮ Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports ⋮ The capacitated vehicle routing problem with stochastic demands and time windows ⋮ A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables ⋮ Pre-disaster investment decisions for strengthening a highway network ⋮ Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip ⋮ Applying the minimax criterion in stochastic recourse programs ⋮ Stochastic set packing problem ⋮ A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract ⋮ A risk-averse approach for the planning of a hybrid energy system with conventional hydropower ⋮ An exact solution method for the TSP with drone based on decomposition ⋮ Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design ⋮ Integration of progressive hedging and dual decomposition in stochastic integer programs ⋮ The bilevel knapsack problem with stochastic right-hand sides ⋮ Investment effects of pricing schemes for non-convex markets ⋮ Stochastic single-allocation hub location ⋮ Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework ⋮ Benders' decomposition for the balancing of assembly lines with stochastic demand ⋮ A comparative study of decomposition algorithms for stochastic combinatorial optimization ⋮ An optimality cut for mixed integer linear programs ⋮ Operations research challenges in forestry: 33 open problems ⋮ Modeling supplier selection and the use of option contracts for global supply chain design ⋮ Stochastic vehicle routing ⋮ Planning models for freight transportation ⋮ A cutting-plane approach to mixed 0-1 stochastic integer programs ⋮ Cutting plane algorithms for solving a stochastic edge-partition problem ⋮ L-shaped decomposition of two-stage stochastic programs with integer recourse ⋮ A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands ⋮ Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands ⋮ On the Glivenko-Cantelli problem in stochastic programming: mixed-integer linear recourse. ⋮ Dual decomposition in stochastic integer programming ⋮ Stochastic programming with simple integer recourse ⋮ The stochastic location-assignment problem on a tree ⋮ B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic vehicle routing with modified savings algorithm
• A multicut algorithm for two-stage stochastic linear programs
• Partitioning procedures for solving mixed-variables programming problems
• Multistage stochastic programs with block-separable recourse
• Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• Two stage linear programming under uncertainty with 0–1 integer first stage variables
• The Vehicle Routing Problem with Stochastic Travel Times
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming

This page was built for publication: The integer \(L\)-shaped method for stochastic integer programs with complete recourse