论文信息 - An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem

An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem

In this work we present an enumerative scheme for determining the K-best solutions (K > 1) of the one dimensional knapsack problem. If n is the total number of different items and b is the knapsack's capacity, the computational complexity of the proposed scheme is bounded by O(Knb) with memory requirements bounded by O(nb). The algorithm was implemented in a workstation and computational tests for varying values of the parameters were performed.

[1] Nei Yoshihiro Soma,et al. A new enumeration scheme for the knapsack problem , 1987, Discret. Appl. Math..

[2] Bruce L. Golden,et al. Solvingk-shortest and constrained shortest path problems efficiently , 1989 .

[3] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[4] E. Lawler. A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[5] Aarni Perko,et al. Implementation of algorithms for K shortest loopless paths , 1986, Networks.

[6] Toshihide Ibaraki,et al. An efficient algorithm for K shortest simple paths , 1982, Networks.

[7] R. Gomory,et al. Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[8] A.. GENERALIZED DYNAMIC PROGRAMMING METHODS IN INTEGER PROGRAMMING , 2022 .

[9] David Eppstein,et al. Finding the k Shortest Paths , 1999, SIAM J. Comput..

[10] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[11] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[12] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .