Method for solving a convex integer programming problem

DOI10.1155/S0161171203210516zbMath1041.90031OpenAlexW2144113883MaRDI QIDQ1415135

Stefan M. Stefanov

Publication date: 3 December 2003

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/50841

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10)

Related Items (2)

On the solution of multidimensional convex separable continuous knapsack problem with bounded variables ⋮ Well-posedness and primal-dual analysis of some convex separable optimization problems

This page was built for publication: Method for solving a convex integer programming problem