Approximation for multi-knapsack problem
摘要
Suppose that ∏ is a maximization problem,and tha A is an approximation algorithmfor ∏.For every instance I of ∏,define R_A(I)=OPT(I)/A(I),where OPT(I)is the optimal value of I;A(I)is the value of approximate solution given byA,and the performance ratio of algorithm A is
引用本文（GB/T 7714）
张立昂, 李路阳, 黄雄. Approximation for multi-knapsack problem[J]. 中国科学通报：英文版, 1996.
引文网络
本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。