Improving the integer L-shaped method
From MaRDI portal
Publication:2830952
DOI10.1287/IJOC.2016.0695zbMATH Open1348.90498OpenAlexW2405230269MaRDI QIDQ2830952FDOQ2830952
Authors: Gustavo Angulo, S. Ahmed, Santanu S. Dey 
Publication date: 1 November 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2016.0695
Recommendations
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Cutting planes for multistage stochastic integer programs
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Exact Solution to a Location Problem with Stochastic Demands
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- The million-variable ``march for stochastic combinatorial optimization
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Fenchel decomposition for stochastic mixed-integer programming
- Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs
- Exact solutions to a class of stochastic generalized assignment problems
- Forbidden vertices
Cited In (42)
- 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
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems
- Distribution network deployment for omnichannel retailing
- In Memoriam: Shabbir Ahmed (1969–2019)
- An L-shaped method with strengthened lift-and-project cuts
- A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties
- Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem
- The Benders decomposition algorithm: a literature review
- Stochastic RWA and lightpath rerouting in WDM networks
- Progressively strengthening and tuning MIP solvers for reoptimization
- The MIP workshop 2023 computational competition on reoptimization
- Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems
- A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs
- Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
- Stochastic dual dynamic integer programming
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- 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
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
- Stochastic last mile relief network design with resource reallocation
- Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling
- Asynchronous Lagrangian scenario decomposition
- Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning
- Using Lagrangian relaxation to locate hydrogen production facilities under uncertain demand: a case study from Norway
- A stochastic integer programming approach to air traffic scheduling and operations
- Decomposition methods for global solution of mixed-integer linear programs
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut
- A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- Optimization-Driven Scenario Grouping
- Nested benders decomposition for a deterministic biomass feedstock logistics problem
- A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty
- Stochastic planning and scheduling with logic-based Benders decomposition
- Single allocation hub location with heterogeneous economies of scale
- Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse
- Efficient solution methods for a general \(r\)-interdiction median problem with fortification
- Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk
- Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs
Uses Software
This page was built for publication: Improving the integer L-shaped method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830952)
