Abstract
The Minimum Cost Network Flow Problem (MCNFP) constitutes perhaps the most important of the research area of Network Optimization. Recently a new category of algorithms for the MCNFP have been developed. These algorithms belong to a special “exterior type” simplex category and they feature significant tree modifications. This paper presents a new didactic tool for the teaching of this type of algorithms. The proposed educational software can be used in courses like “Graph Theory” or “Combinatorial Optimization”. This tool has been implemented using the Java Programming language and it is platform independed. It constitutes a friendly application, for the instructor, as also for the novice student. Furthermore, its use is analytically shown through an illustrative example. Benefits and drawbacks are thoroughly described in order to support the significance of this visualization tool in computer-aided education and also possible future work is discussed.
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.
