The integer L-shaped method for stochastic integer programs with complete recourse
From MaRDI portal
(Redirected from Publication:688927)
The integer \(L\)-shaped method for stochastic integer programs with complete recourse
The integer \(L\)-shaped method for stochastic integer programs with complete recourse
Recommendations
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- Stochastic programming with simple integer recourse
- Improving the integer L-shaped method
Cites work
- scientific article; zbMATH DE number 4172715 (Why is no real title available?)
- scientific article; zbMATH DE number 3878686 (Why is no real title available?)
- scientific article; zbMATH DE number 4053339 (Why is no real title available?)
- scientific article; zbMATH DE number 193918 (Why is no real title available?)
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- A multicut algorithm for two-stage stochastic linear programs
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Multistage stochastic programs with block-separable recourse
- Partitioning procedures for solving mixed-variables programming problems
- Stochastic vehicle routing with modified savings algorithm
- The Vehicle Routing Problem with Stochastic Travel Times
- Two stage linear programming under uncertainty with 0–1 integer first stage variables
Cited in
(only showing first 100 items - show all)- Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching
- A labeling method for dynamic driver-task assignment with uncertain task durations
- 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
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Optimizing maintenance service contracts through mechanism design theory
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
- The probabilistic orienteering problem
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems
- State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems
- Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- Two-stage stochastic hierarchical multiple risk problems: Models and algorithms
- Strong formulations for multistage stochastic self-scheduling unit commitment
- Minimizing value-at-risk in single-machine scheduling
- Higher-order total variation bounds for expectations of periodic functions and simple integer recourse approximations
- An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
- Vehicle routing with probabilistic capacity constraints
- Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
- An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs
- Exact solutions to a class of stochastic generalized assignment problems
- Large-scale unit commitment under uncertainty: an updated literature survey
- Distribution network deployment for omnichannel retailing
- Tight second stage formulations in two-stage stochastic mixed integer programs
- Allocation and scheduling of conditional task graphs
- The bilevel knapsack problem with stochastic right-hand sides
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
- Fleet \& tail assignment under uncertainty
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- The capacitated vehicle routing problem with stochastic demands and time windows
- Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach
- Two‐stage stochastic integer programming: a survey
- Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables
- A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound
- A dual-level stochastic fleet size and mix problem for offshore wind farm maintenance operations
- Improving the integer L-shaped method
- Pseudo-valid cutting planes for two-stage mixed-integer stochastic programs with right-hand-side uncertainty
- Multicomponent Maintenance Optimization: A Stochastic Programming Approach
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
- Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems
- A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs
- An optimality cut for mixed integer linear programs
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
- The Benders decomposition algorithm: a literature review
- Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem
- Multi-service multi-facility network design under uncertainty
- Pre-disaster investment decisions for strengthening a highway network
- A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models
- Stochastic RWA and lightpath rerouting in WDM networks
- A selective newsvendor approach to order management
- Optimizing integrated aircraft assignment and turnaround handling
- Integer set reduction for stochastic mixed-integer programming
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
- The stochastic location-assignment problem on a tree
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- A two-stage stochastic integer programming model for a thermal power system expansion
- Planning models for freight transportation
- A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs
- \(K\)-adaptability in two-stage robust binary programming
- Dual decomposition in stochastic integer programming
- Cutting planes for the multistage stochastic unit commitment problem
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
- Solving minimum-cost shared arborescence problems
- Stochastic set packing problem
- Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems
- Decomposition methods for the two-stage stochastic Steiner tree problem
- A comparative study of decomposition algorithms for stochastic combinatorial optimization
- A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
- On the expected value function of a simple integer recourse problem with random technology matrix
- Stochastic Lipschitz dynamic programming
- Probabilistic partial set covering with an oracle for chance constraints
- Stable annual scheduling of medical residents using prioritized multiple training schedules to combat operational uncertainty
- An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information
- Team Orienteering with Time-Varying Profit
- Decision tree analysis for a risk averse decision maker: CVaR criterion
- Solving a class of stochastic mixed-integer programs with branch and price
- A study on the optimal inventory allocation for clinical trial supply chains
- A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract
- A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
- Two-stage stochastic mixed-integer programs: algorithms and insights
- Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
- Decomposition methods in stochastic programming
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Designing e‐commerce supply chains: a stochastic facility–location approach
- Risk-averse two-stage stochastic programming with an application to disaster management
- Risk-based models for emergency shelter and exit design in buildings
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
- Stochastic dual dynamic integer programming
- Mathematical programming formulations for the collapsed k-core problem
- 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
- Investment effects of pricing schemes for non-convex markets
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- Benders' decomposition for the balancing of assembly lines with stochastic demand
This page was built for publication: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688927)
