Method for solving a convex integer programming problem (Q1415135)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Method for solving a convex integer programming problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Method for solving a convex integer programming problem |
scientific article |
Statements
Method for solving a convex integer programming problem (English)
0 references
3 December 2003
0 references
Summary: 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.
0 references
