Abstract
AbstractAn algorithm is derived for a class of continuous‐time minimum‐cost network flow problems. The algorithm is based on some recent results in the theory of separated continuous linear programs and works with a sequence of discrete approximations to the continuous‐time problem. We prove the convergence of the algorithm and present some numerical results which compare its performance against that of linear network flow algorithms applied to a uniform discrete approximation of the continuous‐time problem.
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.
