A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint
暂无分享,去创建一个
[1] Eugene L. Lawler,et al. Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[2] Hans Kellerer,et al. Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications , 2010, Algorithmica.
[3] Hans Kellerer,et al. Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem , 2004, J. Comb. Optim..
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Giovanni Righini,et al. A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint , 2010, CTW.
[6] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[7] Hans Kellerer,et al. A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem , 1999, J. Comb. Optim..
[8] Lyès Benyoucef,et al. Optimal buying from online retailers offering total value discounts , 2008, ICEC.
[9] Paola Cappanera,et al. A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem , 2001, INFORMS J. Comput..