Decomposition methods for global solution of mixed-integer linear programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 663895 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- A brief history of linear and mixed-integer programming computation
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- 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
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- A primal dual modified subgradient algorithm with sharp Lagrangian
- A simple effective heuristic for embedded mixed-integer quadratic programming
- A two-level distributed algorithm for nonconvex constrained optimization
- Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- 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
- Dual decomposition in stochastic integer programming
- Exact augmented Lagrangian duality for mixed integer linear programming
- Fenchel decomposition for stochastic mixed-integer programming
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Improving the integer L-shaped method
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- JuMP: a modeling language for mathematical optimization
- Julia: a fresh approach to numerical computing
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Mixed integer programming: analyzing 12 years of progress
- Multiplier and gradient methods
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Outer approximation algorithm for nondifferentiable optimization problems
- Parallelizing the dual revised simplex method
- Partitioning procedures for solving mixed-variables programming problems
- Revisiting augmented Lagrangian duals
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- Stochastic Lipschitz dynamic programming
- Stochastic dual dynamic integer programming
- Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization
- Strengthened benders cuts for stochastic integer programs with continuous recourse
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- The Benders decomposition algorithm: a literature review
- The Benders dual decomposition method
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The million-variable ``march for stochastic combinatorial optimization
- The multiplier method of Hestenes and Powell applied to convex programming
- The value function of a mixed integer program: I
Cited in
(1)
This page was built for publication: Decomposition methods for global solution of mixed-integer linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490313)
