Mean value cross decomposition applied to integer programming problems
type: Item
instance of: scholarly article
title: Mean value cross decomposition applied to integer programming problems
zbMATH Open document ID: 0923.90119
DOI: 10.1016/S0377-2217(96)00139-7
author: Kaj Holmberg
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1253151
zbMATH Keywords: Lagrange multipliers
zbMATH Keywords: mean value cross decomposition method
zbMATH Keywords: lower bounds
zbMATH Keywords: clustering
MaRDI profile type: Publication
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Decomposition Principle for Linear Programs
cites work: Q4178782
cites work: Validation of subgradient optimization
cites work: On the convergence of cross decomposition
cites work: Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
cites work: A convergence proof for linear mean value cross decomposition
cites work: Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts
cites work: Two-Level Planning
cites work: Q3738922
cites work: Cluster Analysis: An Application of Lagrangian Relaxation
cites work: Q5566712
cites work: Minimization of unsmooth functionals
cites work: An iterative method of solving a game
cites work: Cross decomposition for mixed integer programming
full work available at URL: s0377-2217(96)00139-7
OpenAlex ID: W2094427801
description: scientific article; zbMATH DE number 1253151