مرکز منطقه ای اطلاع رساني علوم و فناوري - A short proof of optimality of the Bottom Up algorithm for discrete resource allocation problems

Title of article :

A short proof of optimality of the Bottom Up algorithm for discrete resource allocation problems

Author/Authors :

A. Zaporozhets، نويسنده ,

Issue Information :

دوماهنامه با شماره پیاپی سال 1997

Pages :

From page :

To page :

Keywords :

Polymatroid , integer programming , Resource allocation problem , greedy algorithm

Journal title :

Operations Research Letters

Serial Year :

1997

Journal title :

Operations Research Letters

Record number :

137081

Link To Document :