Decomposition methods for global solution of mixed-integer linear programs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
Exact augmented Lagrangian duality for mixed integer linear programming
A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
The integer \(L\)-shaped method for stochastic integer programs with complete recourse
Partitioning procedures for solving mixed-variables programming problems
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
The value function of a mixed integer program: I
Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
L-shaped decomposition of two-stage stochastic programs with integer recourse
Dual decomposition in stochastic integer programming
Parallelizing the dual revised simplex method
A globally convergent algorithm for nonconvex optimization based on block coordinate update
Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
Global convergence of ADMM in nonconvex nonsmooth optimization
The Benders decomposition algorithm: a literature review
Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach
Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
Outer approximation algorithm for nondifferentiable optimization problems
A finite branch-and-bound algorithm for two-stage stochastic integer programs
Fenchel decomposition for stochastic mixed-integer programming
A brief history of linear and mixed-integer programming computation
An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
Revisiting augmented Lagrangian duals
Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization
Stochastic Lipschitz dynamic programming
A primal dual modified subgradient algorithm with sharp Lagrangian
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
Stochastic dual dynamic integer programming
A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
The million-variable ``march for stochastic combinatorial optimization
On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
Multiplier and gradient methods
The multiplier method of Hestenes and Powell applied to convex programming
The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
A two-level distributed algorithm for nonconvex constrained optimization
Improving the Integer L-Shaped Method
Julia: A Fresh Approach to Numerical Computing
Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
On Augmented Lagrangian Methods with General Lower-Level Constraints
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs
The Benders Dual Decomposition Method
A simple effective heuristic for embedded mixed-integer quadratic programming
Mixed Integer Programming: Analyzing 12 Years of Progress
Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
JuMP: A Modeling Language for Mathematical Optimization
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse

This page was built for publication: Decomposition methods for global solution of mixed-integer linear programs