NASA NTRS · 19740022437
Finite pure integer programming algorithms employing only hyperspherically deduced cuts
Abstract
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.
Keep this discovery
Explore connections, maps & timelines
Young, R. D.. 1971-05-03. Finite pure integer programming algorithms employing only hyperspherically deduced cuts. https://ntrs.nasa.gov/citations/19740022437
Cite the original work for its findings. Save a collection to share your selection of sources.