Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
Optimality criterion for a class of nonlinear integer programs
Operations Research Letters
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
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.