Method for solving a convex integer programming problem

Stefan M. Stefanov

International Journal of Mathematics and Mathematical Sciences, 2003, vol. 2003, 1-6

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.

Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2003/321324.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2003/321324.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:321324

DOI: 10.1155/S0161171203210516

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().