Skip to main content
SpringerLink
Log in

A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint

  • Conference paper
Algorithmic Applications in Management (AAIM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3521))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balas, E., Zemel, E.: An Algorithm for Large Zero-One Knapsack Problem. Operations Research 28(5), 1130–1154 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bretthauer, K.M., Shetty, B.: The nonlinear knapsack problem - algorithms and applications. European Journal of Operational Research 138(3), 459–472 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Eppstein, D.: Finding the k shortest paths. SIAM Journal of Computing 28, 652–673 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Giffler, B.: Schedule Algebra: A Progress Report. Naval Research Logistics Quarterly 15, 255–280 (1968)

    Google Scholar 

  5. Lin, E.: A bibliographical survey on some well-known non-standard knapsack problems. INFOR 36(4), 274–317 (1998)

    Google Scholar 

  6. Salkin, H.M., Kluyver, C.: Knapsack problem – Survey. Naval Research Logistics 22(1), 127–144 (1975)

    Article  MATH  Google Scholar 

  7. Sarin, S.C.: Mixed Disc Packing Problem: Part I. IIE Transactions 15(1), 37–45 (1983)

    Article  MathSciNet  Google Scholar 

  8. Sarin, S.C., Ahn, S.: Mixed Disc Packing Problem: Part II. IIE Transactions 15(2), 91–98 (1983)

    Article  Google Scholar 

  9. Shapiro, J.F.: Dynamic Programming Algorithm for Integer Programming Problem I: The Integer Programming Problem Viewed as a Knapsack Type Problem. Operations Research 16(1), 103–121 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  10. Shier, D.R.: Interactive Methods for Determining the K Shortest Paths in a Network. Networks 6, 205–229 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  11. Wongseelashote, A.: An Algebra for Determining all Path-Values in a Network with Application to K-Shortest-Paths Problems. Networks 6, 307–334 (1976)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Virginia Polytechnic Institute and State University, Blacksburg, VA, 24061, USA

    Subhash C. Sarin, Yuqiang Wang & Dae B. Chang

Authors
  1. Subhash C. Sarin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuqiang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dae B. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBM Almaden Research Center, 650 Harry Road, 95120, San Jose, CA,  

    Nimrod Megiddo

  2. The State Key Lab for Manufacturing Systems Engineering, 710049, Xi’an, P.R. China

    Yinfeng Xu

  3. Department of Computer Science, Montana State University, 59717, Bozeman, MT, USA

    Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sarin, S.C., Wang, Y., Chang, D.B. (2005). A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_47

Download citation

  • DOI: https://doi.org/10.1007/11496199_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26224-4

  • Online ISBN: 978-3-540-32440-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation