Approximation algorithms for knapsack problems with cardinality constraints
暂无分享,去创建一个
Hans Kellerer | Alberto Caprara | David Pisinger | Ulrich Pferschy | H. Kellerer | Ulrich Pferschy | David Pisinger | A. Caprara | U. Pferschy
[1] Nimrod Megiddo,et al. Linear time algorithms for some separable quadratic programming problems , 1993, Oper. Res. Lett..
[2] A. Frieze,et al. Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses , 1984 .
[3] Hans Kellerer,et al. An Efficient Approximation Scheme for the Subset-Sum Problem , 1997, ISAAC.
[4] Eugene L. Lawler,et al. Parameterized Approximation Scheme for the Multiple Knapsack Problem , 2009, SIAM J. Comput..
[5] Gerhard J. Woeginger,et al. Simple But Efficient Approaches for the Collapsing Knapsack Problem , 1997, Discret. Appl. Math..
[6] Hans Kellerer,et al. A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem , 1999, J. Comb. Optim..
[7] Eugene L. Lawler,et al. Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[8] David Pisinger. A Fast Algorithm for Strongly Correlated Knapsack Problems , 1998, Discret. Appl. Math..
[9] Eugene Levner,et al. Fast approximation algorithms for knapsack type problems , 1980 .
[10] Michael R. Fellows,et al. FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .
[11] Sartaj Sahni,et al. Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.
[12] Torben Hagerup,et al. A Randomized Maximum-Flow Algorithm , 1995, SIAM J. Comput..
[13] Marc E. Posner,et al. The Collapsing 0–1 Knapsack Problem , 1978, Math. Program..
[14] Yingjie Liu. The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem , 2002, Theory of Computing Systems.
[15] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..
[16] Hans Kellerer,et al. A New Fully Polynomial Approximation Scheme for the Knapsack Problem , 1998, APPROX.
[17] Matteo Fischetti. A new linear storage, polynomial-time approximation scheme for the subset-sum problem , 1990, Discret. Appl. Math..
[18] Rainer Schrader,et al. ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES , 1981 .
[19] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[20] Michael R. Fellows,et al. Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..
[21] François Vanderbeck,et al. Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..