A schedule algebra based approach to determine the k-best solutions of a knapsack problem with a single constraint

Authors:
Subhash C. Sarin;Yuqiang Wang;Dae B. Chang
Affiliations:
Virginia Polytechnic Institute and State University, Blacksburg, VA;Virginia Polytechnic Institute and State University, Blacksburg, VA;Virginia Polytechnic Institute and State University, Blacksburg, VA
Venue:
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Year:
2005

Citing 1
Cited 0

Finding the k Shortest Paths

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we develop a new and effective schedule algebra based algorithm to determine the K-best solutions of a knapsack problem with a single constraint. Computational experience with this algorithm is also reported and it is shown to dominate both the dynamic programming and branch and bound based procedures when applied to this problem.