Abstract
After an introduction we describe in Section 2 the joint capacity assignment concentrator location problem in terms of a mixed-integer-programming problem. Section 3 proposes a heuristic algorithm to solve the problem. Section 4 illustrates the algorithm in a hypothetical example and shows some results using it in a simulation context.
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.
