论文信息 - Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions - 字舞流文

Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions

I. Sigal | A. Korbut

[1] I. Sigal,et al. Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation , 2009 .

[2] Gennady Diubin,et al. The average behaviour of greedy algorithms for the knapsack problem: General distributions , 2003, Math. Methods Oper. Res..

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .