A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron

Kurt M. Bretthauer, A. Victor Cabot. A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron. Computers & OR, 21(7):777-785, 1994. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.