Solving the mixed-integer knapsack problem by decrease of dimension and use of dynamic programming
Published in Automatic Control and Computer Sciences • Jul 1, 2015
Authors:,,
К. Sh. Mamedov
K. K. Mamedov
S. K. Elchueva
Abstract
A method for finding an optimal solution of mixed-integer programming problems with one constraint is proposed. Initially, this method lessens the number of variables and the interval of their change; then, for the resulting problem one derives recurrent relations of dynamic programming that are use...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!