A convergence proof for linear mean value cross decomposition
From MaRDI portal
Publication:4296293
Recommendations
- Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
- Mean value cross decomposition applied to integer programming problems
- scientific article; zbMATH DE number 2154248
- On the convergence of cross decomposition
- Mean value cross decomposition for nonlinear convex problems
Cites work
- An iterative method of solving a game
- Cross decomposition for mixed integer programming
- Decomposition Principle for Linear Programs
- Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
- On the convergence of cross decomposition
- Partitioning procedures for solving mixed-variables programming problems
- Two-Level Planning
Cited in
(10)- Efficient decomposition and linearization methods for the stochastic transportation problem
- scientific article; zbMATH DE number 4131948 (Why is no real title available?)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- Mean value cross decomposition for nonlinear convex problems
- On the convergence of cross decomposition
- On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
- Mean value cross decomposition applied to integer programming problems
This page was built for publication: A convergence proof for linear mean value cross decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296293)
