A GENERALIZED IMPLICIT ENUMERATION ALGORITHM FOR A CLASS OF INTEGER NONLINEAR PROGRAMMING 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.

SABBAGH M.S.; ROUSHAN JOUY M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2008 | Volume:4 | Issue:6 Page(s): 39-50

Download Full-Text

View:

395

Download:

Cites:

Information Journal Paper

Title

A GENERALIZED IMPLICIT ENUMERATION ALGORITHM FOR A CLASS OF INTEGER NONLINEAR PROGRAMMING PROBLEM

Author(s)

SABBAGH M.S. | ROUSHAN JOUY M. | Issue Writer Certificate

Keywords

ALGEBRAIC FORM

FUNCTION VALUES

GENERALIZED IMPLICIT ENUMERATION

INTEGER PROGRAMMING

LINEAR SPEEDUP

Abstract

Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objective function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named LINEAR SPEEDUP, to use whatever explicit linear constraints are present to speed up the search for a solution. The method is easy to understand and implement, yet very effective in dealing with many INTEGER PROGRAMMING problems, including knapsack problems, reliability optimization, and spare allocation problems. To see some application of the generalized algorithm, we notice that the branch-and-bound is the popular method to solve integer linear programming problems. But branch-and bound cannot efficiently solve all integer linear programming problems. For example, De Loera et al. in their 2005 paper discuss some knapsack problems that CPLEX cannot solve in hours. We use our generalized algorithm to find a global or near global optimal solutions for those problems, in less than 100 seconds. The algorithm is based on FUNCTION VALUES only; it does not require continuity or differentiability of the problem functions. This allows its use on problems whose functions cannot be expressed in closed ALGEBRAIC FORM. The reliability and efficiency of the proposed algorithm has been demonstrated on some integer optimization problems taken from the literature.

Cites

No record.

References

No record.

Cite

APA: Copy

SABBAGH, M.S., & ROUSHAN JOUY, M.. (2008). A GENERALIZED IMPLICIT ENUMERATION ALGORITHM FOR A CLASS OF INTEGER NONLINEAR PROGRAMMING PROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 4(6), 39-50. SID. https://sid.ir/paper/309808/en

Vancouver: Copy

SABBAGH M.S., ROUSHAN JOUY M.. A GENERALIZED IMPLICIT ENUMERATION ALGORITHM FOR A CLASS OF INTEGER NONLINEAR PROGRAMMING PROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2008;4(6):39-50. Available from: https://sid.ir/paper/309808/en

IEEE: Copy

M.S. SABBAGH, and M. ROUSHAN JOUY, “A GENERALIZED IMPLICIT ENUMERATION ALGORITHM FOR A CLASS OF INTEGER NONLINEAR PROGRAMMING PROBLEM,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 4, no. 6, pp. 39–50, 2008, [Online]. Available: https://sid.ir/paper/309808/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops