Abstract
AbstractThis article proposes two approximate methods to solve capacitated, single‐commodity and fixed‐charge network flow problems. First, relaxed problems obtained by the Lagrange relaxation method are shown to form a minimum spanning tree problem, yielding a lower bound to the original problem. The subgradient optimization technique can be then applied to improve this bound by updating the Lagrange multipliers. The second part of the article presents a new, simple, and efficient heuristic to find a feasible and approximate solution that is also an upper bound to the original problem.
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.
