Group-theoretic method of decomposition methods in integer linear programming

zbMATH Open0778.90040MaRDI QIDQ1802604FDOQ1802604

Authors: I. L. Averbakh 

Publication date: 6 September 1993

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 55953
• Decomposition in integer linear programming
• A decomposition method of integer programming
• Decomposition of integer programs and of generating sets
• Multilevel decomposition in mixed-integer block programming

zbMATH Keywords

lower boundsdecomposition methodgroup theoretic approachblock linear integer programmingconnecting constraints

Mathematics Subject Classification ID

Integer programming (90C10)

Cited In (7)

• A decomposition method of integer programming
• Title not available (Why is that?)
• Decomposition of integer programs and of generating sets
• Title not available (Why is that?)
• Nondecomposable solutions to group equations and an application to polyhedral combinatorics
• Standard pairs and group relaxations in integer programming
• Title not available (Why is that?)

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)