Abstract
AbstractIn this article we present three properties that will improve the performance of branch‐and‐bound algorithms for fixed‐cost transportation problems. By applying Lagrangian relaxation we show that one can develop stronger up and down penalties than those traditionally used and also develop a strengthened penalty for nonbasic variables. We also show that it is possible to “look ahead” of a particular node and determine the solution at the next node without actually calculating it. We present computational evidence by comparing our developments with existing procedures.
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.
