Answers are grounded in this paper and cite their sources.
The usefulness of group theoretic methods in solving integer programming (IP) problems is extended by procedures for controlling the size of the groups. The main procedure given shows how an optimal linear programming basis can be altered to reduce the magnitude of its determinant thereby reducing the size of the group induced by the basis. An adaption of Benders' mixed IP algorithm is given which uses these methods. Some limited computational experience is given.
No takes yet. Share an insight, caveat, or question.
Gorry et al. (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: