Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
From MaRDI portal
Publication:1203802
DOI10.1016/0377-2217(92)90177-BzbMath0770.90041OpenAlexW2020317140MaRDI QIDQ1203802
Publication date: 18 February 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90177-b
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, Efficient decomposition and linearization methods for the stochastic transportation problem, A convergence proof for linear mean value cross decomposition, A hybrid approach of bundle and Benders applied large mixed linear integer problem, A simple modification of dantzig-wolfe decomposition, Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem, Decomposition in general mathematical programming, Mean value cross decomposition for nonlinear convex problems, Mean value cross decomposition applied to integer programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of cross decomposition
- Cross decomposition applied to the stochastic transportation problem
- On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs
- Partitioning procedures for solving mixed-variables programming problems
- An iterative method of solving a game
- Decomposition Principle for Linear Programs
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A convergence proof for linear mean value cross decomposition
- Cross decomposition for mixed integer programming
- Two-Level Planning
- Letter to the Editor—A Multicommodity Max-Flow Algorithm
- Minimization of unsmooth functionals
