M. Leitner and G. R. Raidl, “A Lagrangian Decomposi tion Based Heuristic for Capacitated Connected Facility Location,” In S. VoB and M. Caserta, Eds., Proceedings of the 8th Metaheuristic International Conference (MIC 2009), Hamburg, 13-16 July 2009. - References

Browse Menu >>

Browse Subjects >>

Computer Science & Communications

Earth & Environmental Sciences

Social Sciences & Humanities

Why Us? >>

- Open Access
- Peer-reviewed
- Rapid publication
- Lifetime hosting
- Free indexing service
- Free promotion service
- More citations
- Search engine friendly

Free SCIRP Newsletters>>

Add your e-mail address to receive free newsletters from SCIRP.

Contact Us >>

customer@scirp.org

+86 18163351462(WhatsApp)

1655362766

Paper Publishing WeChat

Book Publishing WeChat

(or Email:book@scirp.org)

Article citations
More>>

M. Leitner and G. R. Raidl, “A Lagrangian Decomposi tion Based Heuristic for Capacitated Connected Facility Location,” In: S. VoB and M. Caserta, Eds., Proceedings of the 8th Metaheuristic International Conference (MIC 2009), Hamburg, 13-16 July 2009.

has been cited by the following article:

TITLE: Implementing Lagrangean Decomposition Technique to Acquire an Adequate Lower Boundon the Facility Location Problem Solution

AUTHORS: Eiman Jadaan Alenezy, Rehab F. Khalaf

KEYWORDS: Capacitated Facility Location Problem; Lagrangean Relaxation Technique; Volume Algorithm;Randomised Rounding Technique; Unit Cost Technique

JOURNAL NAME: Applied Mathematics, Vol.4 No.8, July 30, 2013

ABSTRACT: In this work, the Lagrangean Relaxation method has been discussed to solve different sizes of capacitated facility location problem (CFLP). A good lower bound has been achieved on the solution of the CFLP considered in this paper. This lower bound has been improved by using the Volume algorithm. The methods of setting two important parameters in heuristic have been given. The approaches used to gain the lower bound have been explained. The results of this work have been compared with the known results given by Beasley.