A lower bound of 12n2 on linear search programs for the Knapsack problem

作者:

Highlights:

摘要

论文关键词:

论文评审过程:Received 17 June 1976, Revised 10 June 1977, Available online 2 December 2003.

论文官网地址:https://doi.org/10.1016/0022-0000(78)90026-0