A LOCAL BRANCHING APPROACH FOR THE SET COVERING 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.

YAGHINI MASOUD; SARMADI MOHAMMADREZA; MOMENI MOHSEN

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

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2014 | Volume:25 | Issue:2 Page(s): 95-102

Download Full-Text

View:

282

Download:

128

Cites:

Information Journal Paper

Title

A LOCAL BRANCHING APPROACH FOR THE SET COVERING PROBLEM

Author(s)

YAGHINI MASOUD | SARMADI MOHAMMADREZA | MOMENI MOHSEN | Issue Writer Certificate

Keywords

HEURISTICS

SET COVERING PROBLEM

LOCAL BRANCHING ALGORITHM

DESIGN OF EXPERIMENTS

Abstract

The SET COVERING PROBLEM (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching-based solution approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by DESIGN OF EXPERIMENTS approach. The proposed method is tested on the several standard instances. The results show that the algorithm outperforms the best heuristic approaches found in the literature.

Cites

No record.

References

No record.

Cite

APA: Copy

YAGHINI, MASOUD, SARMADI, MOHAMMADREZA, & MOMENI, MOHSEN. (2014). A LOCAL BRANCHING APPROACH FOR THE SET COVERING PROBLEM. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), 25(2), 95-102. SID. https://sid.ir/paper/647795/en

Vancouver: Copy

YAGHINI MASOUD, SARMADI MOHAMMADREZA, MOMENI MOHSEN. A LOCAL BRANCHING APPROACH FOR THE SET COVERING PROBLEM. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH)[Internet]. 2014;25(2):95-102. Available from: https://sid.ir/paper/647795/en

IEEE: Copy

MASOUD YAGHINI, MOHAMMADREZA SARMADI, and MOHSEN MOMENI, “A LOCAL BRANCHING APPROACH FOR THE SET COVERING PROBLEM,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), vol. 25, no. 2, pp. 95–102, 2014, [Online]. Available: https://sid.ir/paper/647795/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops