Finite Pure Integer Programming Algorithms Employing Only Hyperspherically Deduced Cuts

摘要

Three algorithms are developed that may be based exclusively on hyperspherically deduced cuts. The algorithms only apply, therefore, to problems structured so that these cuts are valid. The algorithms are shown to be finite. (Author)