![]() |
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
We have constructed new Graphical approach based on the dynamicalprogramming method [1,2] to decide Partition, Knapsack andscheduling problems $1\mid\,\mid\sum w_j T_j, \ 1\mid\,\mid\sumw_j U_j$.