Reoptimizing the 0-1 knapsack problem
暂无分享,去创建一个
[1] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Eugene L. Lawler,et al. Parameterized Approximation Scheme for the Multiple Knapsack Problem , 2009, SIAM J. Comput..
[4] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[5] Vangelis Th. Paschos,et al. Reoptimization of minimum and maximum traveling salesman's tours , 2009, J. Discrete Algorithms.
[6] Sartaj Sahni,et al. Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.
[7] Luca Bertazzi,et al. Reoptimizing the traveling salesman problem , 2003, Networks.
[8] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[9] Hans Kellerer,et al. A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem , 1999, J. Comb. Optim..
[10] Hans Kellerer,et al. Approximation algorithms for knapsack problems with cardinality constraints , 2000, Eur. J. Oper. Res..
[11] Juraj Hromkovic,et al. On the Hardness of Reoptimization , 2008, SOFSEM.
[12] Hans Kellerer,et al. Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem , 2004, J. Comb. Optim..
[13] Markus W. Schäffter,et al. Scheduling with Forbidden Sets , 1997, Discret. Appl. Math..
[14] Hans Kellerer,et al. Knapsack problems , 2004 .