Decomposition in global optimization
From MaRDI portal
Recommendations
- Decomposition in general mathematical programming
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- scientific article; zbMATH DE number 176467
- On general decomposition schemes in mathematical programming
- Decomposition of an optimal planning problem
Cites work
- scientific article; zbMATH DE number 3819432 (Why is no real title available?)
- scientific article; zbMATH DE number 51275 (Why is no real title available?)
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Generalized Approach to Dantzig-Wolfe Decomposition for Concave Programs
- A resource decomposition algorithm for general mathematical programs
- A unified approach for price directive decomposition procedures in integer programming
- An elementary survey of general duality theory in mathematical programming
- Cross decomposition for mixed integer programming
- Generalized Benders decomposition
- On general decomposition schemes in mathematical programming
- On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs
- Partitioning procedures for solving mixed-variables programming problems
- Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
- The Decomposition Algorithm for Linear Programs
- Two-Level Planning
Cited in
(3)
This page was built for publication: Decomposition in global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186267)
