Group-theoretic method of decomposition methods in integer linear programming
type: Item
instance of: scholarly article
title: Group-theoretic method of decomposition methods in integer linear programming
zbMATH Open document ID: 0778.90040
author: I. L. Averbakh
published in: Computational Mathematics and Mathematical Physics
publication date: 1993-09-06T00:00:00Z
review text: A decomposition method for the solution of block linear integer programming problems with connecting constraints, which are of the form of equations on a finite Abelian group is suggested. In this method the solution of the input problem is reduced to solving some problems on subgroups having smaller orders. The above method is used for obtaining lower bounds in a branch and bound method for solving block linear integer programming problems. The determination of the lower bounds is based on constructing special auxiliary problems. These problems are block linear integer programming problems with connecting constraints of the above type. In the result a new decomposition method based on a group theoretic approach is obtained for solving block linear integer programs.
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 205027
zbMATH Keywords: block linear integer programming
zbMATH Keywords: connecting constraints
zbMATH Keywords: lower bounds
zbMATH Keywords: decomposition method
zbMATH Keywords: group theoretic approach
reviewed by: Ya. M. Shafransky
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 205027