Abstract
We develop a Benders-and-cut algorithm for fixed-charge capacitated network design problem which incorporates both Benders cuts and polyhedral cuts into an implicit branch-and-bound algorithm. The algorithm is tested over a wide range of problem instances with varying sizes and traffic conditions. It is shown that this new algorithm’s performance is competitive compared with existing algorithms, and that Benders cuts are more effective under heavy traffic load, while cut set inequalities are more effective under light traffic load.
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.
