A new enumeration scheme for the knapsack problem
暂无分享,去创建一个
[1] Egon Balas,et al. An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..
[2] Harriet Griffin,et al. Elementary theory of numbers , 1955 .
[3] S. Senju,et al. An Approach to Linear Programming with 0--1 Variables , 1968 .
[4] Bennett L. Fox,et al. Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound , 1979, Oper. Res..
[5] Denis C. Onyekwelu. Technical Note - Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems , 1983, Oper. Res..
[6] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[7] L. J. Savage,et al. Three Problems in Rationing Capital , 1955 .
[8] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[9] G. Dantzig. Discrete-Variable Extremum Problems , 1957 .
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..
[12] Bruce Faaland. Technical Note - Solution of the Value-Independent Knapsack Problem by Partitioning , 1973, Oper. Res..
[13] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[14] Sartaj Sahni,et al. Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.
[15] Ravi Kannan,et al. Polynomial-Time Aggregation of Integer Programming Problems , 1983, JACM.
[16] C. M. Shetty,et al. Computational results with a branch-and-bound algorithm for the general knapsack problem , 1979 .
[17] Jeremy F. Shapiro,et al. A Finite Renewal Algorithm for the Knapsack and Turnpike Models , 1967, Oper. Res..
[18] Paolo Toth,et al. Worst-case analysis of greedy algorithms for the subset-sum problem , 1984, Math. Program..
[19] Eugene L. Lawler,et al. Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[20] Charles M. Harvey,et al. Operations Research: An Introduction to Linear Optimization and Decision Analysis , 1979 .
[21] Harold Greenberg. An algorithm for the computation of knapsack functions , 1969 .
[22] S. Martello,et al. An upper bound for the zero-one knapsack problem and a branch and bound algorithm , 1977 .
[23] J. H. Ahrens,et al. Merging and Sorting Applied to the Zero-One Knapsack Problem , 1975, Oper. Res..
[24] W. Sierpinski. Elementary Theory of Numbers , 1964 .
[25] Ellis Horowitz,et al. Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.
[26] R. Gomory,et al. Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .
[27] Vasek Chvátal,et al. Hard Knapsack Problems , 1980, Oper. Res..
[28] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .
[29] D. FAYARD,et al. Resolution of the 0–1 knapsack problem: Comparison of methods , 1975, Math. Program..
[30] Harvey M. Salkin,et al. The knapsack problem: A survey , 1975 .