مرکز منطقه ای اطلاع رساني علوم و فناوري - An approximate binary search algorithm for the multiple-choice knapsack problem

Title of article :

An approximate binary search algorithm for the multiple-choice knapsack problem

Author/Authors :

George Gens، نويسنده , , Eugene Levner، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1998

Pages :

From page :

261

To page :

265

Keywords :

Knapsack problem , Algorithms , Approximate binary search , approximate algorithms

Journal title :

Information Processing Letters

Serial Year :

1998

Journal title :

Information Processing Letters

Record number :

128948

Link To Document :