Year-end Sale % OFF 
Abstract
In this paper we present a Lagrangian relaxation-based heuristic for solving the capacitated plantlocation problem with side constraints. The side constraints are upper-bound constraints on disjoint subsets of the (0-1) variables. Computational results are reported for some problems, having been obtained both on a mainframe computer and on a personal computer.
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.
