John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. In this paper, we establish several general results that apply to integer optimization problems with nonlinear objective functions. © 2008 Elsevier B.V. All rights reserved.
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Imran Nasim, Michael E. Henderson
Mathematics