|
Method for solving a convex integer programming problemDOI: 10.1155/s0161171203210516 Abstract: We consider a convex integer program which is a nonlinear version of the assignment problem. This problem is reformulated as an equivalent problem. An algorithm for solving the original problem is suggested which is based on solving the simple assignment problem via some of known algorithms.
|