AN EFFICIENT ALGORITHM FOR REDUCING THE DUALITY GAP IN A SPECIAL CLASS OF THE KNAPSACK PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ESHGHI K.; JAVANSHIR H.

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

Journal Paper

Paper Information

Journal: ESTEGHLAL Year:2005 | Volume:24 | Issue:1 Page(s): 47-57

Download Full-Text

Persian Verion

View:

786

Download:

Cites:

Information Journal Paper

Title

AN EFFICIENT ALGORITHM FOR REDUCING THE DUALITY GAP IN A SPECIAL CLASS OF THE KNAPSACK PROBLEM

Author(s)

ESHGHI K. | JAVANSHIR H. | Issue Writer Certificate

Keywords

SEPARABLE KNAPSACK PROBLEMQ4

SURROGATE CONSTRAINTSQ4

DYNAMIC PROGRAMMINGQ4

Abstract

A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. DYNAMIC PROGRAMMING is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient algorithm is developed to find surrogate multipliers in each stage of DYNAMIC PROGRAMMING in order to transform the original problem to a single constraint problem called surrogate problem. The upper and lower bounds obtained by solving the surrogate problem can eliminate a large number of state variables in DYNAMIC PROGRAMMING and extremely reduce the duality gap according to our computational results.

Cites

No record.

References

No record.

Cite

APA: Copy

ESHGHI, K., & JAVANSHIR, H.. (2005). AN EFFICIENT ALGORITHM FOR REDUCING THE DUALITY GAP IN A SPECIAL CLASS OF THE KNAPSACK PROBLEM. ESTEGHLAL, 24(1), 47-57. SID. https://sid.ir/paper/6023/en

Vancouver: Copy

ESHGHI K., JAVANSHIR H.. AN EFFICIENT ALGORITHM FOR REDUCING THE DUALITY GAP IN A SPECIAL CLASS OF THE KNAPSACK PROBLEM. ESTEGHLAL[Internet]. 2005;24(1):47-57. Available from: https://sid.ir/paper/6023/en

IEEE: Copy

K. ESHGHI, and H. JAVANSHIR, “AN EFFICIENT ALGORITHM FOR REDUCING THE DUALITY GAP IN A SPECIAL CLASS OF THE KNAPSACK PROBLEM,” ESTEGHLAL, vol. 24, no. 1, pp. 47–57, 2005, [Online]. Available: https://sid.ir/paper/6023/en

Related Journal Papers