Year-end Sale % OFF 
Abstract
Abstract Abstract The capacitated plant location problem with linear transportation costs is considered. An algorithm based on ADD/DROP procedures is proposed. Exact rules are presented allowing an a priori opening or closing of facilities. Facilities left are submitted to an extension of the exact rules. Procedures are implemented with the help of lower and upper bounds using Lagrangean relaxation. Computational results are presented and comparisons with other algorithms are made.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
