International Journal of Mathematics and Mathematical Sciences
Volume 2003 (2003), Issue 44, Pages 2829-2834
doi:10.1155/S0161171203210516

Method for solving a convex integer programming problem

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.