Mean value cross decomposition applied to integer programming problems

DOI10.1016/S0377-2217(96)00139-7zbMath0923.90119OpenAlexW2094427801MaRDI QIDQ1278589

Kaj Holmberg

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00139-7

zbMATH Keywords

Lagrange multipliersclusteringlower boundsmean value cross decomposition method

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, A hybrid approach of bundle and Benders applied large mixed linear integer problem, Constrained optimization using multiple objective programming, Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem, A new cross decomposition method for stochastic mixed-integer linear programming, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs, Mean value cross decomposition for nonlinear convex problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of cross decomposition
• Partitioning procedures for solving mixed-variables programming problems
• Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
• An iterative method of solving a game
• Cluster Analysis: An Application of Lagrangian Relaxation
• Decomposition Principle for Linear Programs
• A convergence proof for linear mean value cross decomposition
• Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts
• Cross decomposition for mixed integer programming
• Validation of subgradient optimization
• Two-Level Planning
• Minimization of unsmooth functionals