Group-theoretic method of decomposition methods in integer linear programming
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.
- Standard pairs and group relaxations in integer programming
- scientific article; zbMATH DE number 4029259 (Why is no real title available?)
- scientific article; zbMATH DE number 55953 (Why is no real title available?)
- scientific article; zbMATH DE number 647691 (Why is no real title available?)
- A decomposition method of integer programming
- Decomposition of integer programs and of generating sets
- Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This page was built for publication: Group-theoretic method of decomposition methods in integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802604)
