مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

320
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

127
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

A DYNAMIC PROGRAMMING APPROACH FOR SOLVING NONLINEAR KNAPSACK PROBLEMS

Pages

  31-37

Abstract

 Nonlinear Knapsack Problems (NKP) are the alternative formulation for the MULTIPLE-CHOICE KNAPSACK problems. A powerful approach for solving NKP is dynamic programming which may obtain the global optimal solution even in the case of discrete solution space for these problems. Despite the power of this solution approach, it computationally performs very slowly when the solution space of the problems grows rapidly. In this paper the authors developed a procedure for improving the computational efficiency of the dynamic programming for solving KNP. They incorporate three routines; the IMBEDDED STATE, SURROGATE CONSTRAINTs, and bounding scheme, in the dynamic programming solution approach and developed an algorithmic routine for solving the KNP. An experimental study for comparing the computational efficiency of the proposed approach with the general dynamic programming approach is also presented.

Multimedia

  • No record.

    • Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    JAHANGIRI, E., & GHASEMITARI, F.. (2006). A DYNAMIC PROGRAMMING APPROACH FOR SOLVING NONLINEAR KNAPSACK PROBLEMS. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 2(1), 31-37. SID. https://sid.ir/paper/309831/en

    Vancouver: Copy

    JAHANGIRI E., GHASEMITARI F.. A DYNAMIC PROGRAMMING APPROACH FOR SOLVING NONLINEAR KNAPSACK PROBLEMS. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2006;2(1):31-37. Available from: https://sid.ir/paper/309831/en

    IEEE: Copy

    E. JAHANGIRI, and F. GHASEMITARI, “A DYNAMIC PROGRAMMING APPROACH FOR SOLVING NONLINEAR KNAPSACK PROBLEMS,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 2, no. 1, pp. 31–37, 2006, [Online]. Available: https://sid.ir/paper/309831/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button