Abstract
The application of traditional branch-and-bound (B&B) procedures to the standard formulation of the general fixed charge problem (GFCP) has not proven to be an acceptable approach to solving this well-known problem. It has been suggested by various authors that preprocessing the data and/or adding constraints to the GFCP might lead to improved B&B performance. In this paper, we present extensive computational results to test these hypotheses using the M PSX/MIP/370 package. The results demonstrate that while preprocessing the data is not always effective, simple constraints may be added to the problem allowing us to solve randomly generated GFCPs that are significantly larger than any previously reported in the literature. Results arc also presented which give insight into the effectiveness of a frequently used heuristic for the GFCP.
Sign-in/Register to access full text options 
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.
