On the convergence of cross decomposition
From MaRDI portal
Publication:752000
DOI10.1007/BF01580863zbMATH Open0715.90078OpenAlexW2060208495MaRDI QIDQ752000FDOQ752000
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580863
Numerical mathematical programming methods (65K05) Linear programming (90C05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- Generalized Benders decomposition
- Decomposition Principle for Linear Programs
- Cross decomposition applied to the stochastic transportation problem
- Cross decomposition for mixed integer programming
- A Cross Decomposition Algorithm for Capacitated Facility Location
- On general decomposition schemes in mathematical programming
- A growth property in concave-convex Hamiltonian systems
Cited In (20)
- On foundations of the Hardy Cross method
- Decomposition in general mathematical programming
- A convergence proof for linear mean value cross decomposition
- The Benders decomposition algorithm: a literature review
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- The Benders Dual Decomposition Method
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- Constraint partitioning in penalty formulations for solving temporal planning problems
- Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
- Mean value cross decomposition applied to integer programming problems
- Location and layout planning. A survey
- Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts
- Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
- A new cross decomposition method for stochastic mixed-integer linear programming
- Multiperiod optimal planning of thermal generation using cross decomposition
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem
- On using approximations of the Benders master problem
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- Title not available (Why is that?)
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts π π
- A convergence proof for linear mean value cross decomposition π π
- Mean value cross decomposition for nonlinear convex problems π π
This page was built for publication: On the convergence of cross decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q752000)