@ARTICLE{APSS2007,
  author = {D. Andreou and K. Paparrizos and N. Samaras and A. Sifaleras},
  title = {Visualization of the network exterior primal simplex algorithm for	the minimum cost network flow problem},
  journal = {Operational Research. An International Journal},
  year = {2007},
	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 independent. 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.},
  volume = {7},
  number = {3},
  pages = {449--464},
  publisher = {Springer Berlin/Heidelberg},
  url = {http://dx.doi.org/10.1007/BF03024857},
  pdf = {./papers/Visualization_software_of_the_network_exterior_primal_simplex_algorithm_for_the_minimum_cost_network_flow_problem.pdf}
}

{"_id":"iXcdnjbiezMPACnHJ","bibbaseid":"andreou-paparrizos-samaras-sifaleras-visualizationofthenetworkexteriorprimalsimplexalgorithmfortheminimumcostnetworkflowproblem-2007","downloads":0,"creationDate":"2017-03-04T23:23:11.924Z","title":"Visualization of the network exterior primal simplex algorithm for the minimum cost network flow problem","author_short":["Andreou, D.","Paparrizos, K.","Samaras, N.","Sifaleras, A."],"year":2007,"bibtype":"article","biburl":"http://users.uom.gr/~sifalera/my_publications.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["D."],"propositions":[],"lastnames":["Andreou"],"suffixes":[]},{"firstnames":["K."],"propositions":[],"lastnames":["Paparrizos"],"suffixes":[]},{"firstnames":["N."],"propositions":[],"lastnames":["Samaras"],"suffixes":[]},{"firstnames":["A."],"propositions":[],"lastnames":["Sifaleras"],"suffixes":[]}],"title":"Visualization of the network exterior primal simplex algorithm for the minimum cost network flow problem","journal":"Operational Research. An International Journal","year":"2007","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 independent. 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.","volume":"7","number":"3","pages":"449--464","publisher":"Springer Berlin/Heidelberg","url":"http://dx.doi.org/10.1007/BF03024857","pdf":"./papers/Visualization_software_of_the_network_exterior_primal_simplex_algorithm_for_the_minimum_cost_network_flow_problem.pdf","bibtex":"@ARTICLE{APSS2007,\r\n author = {D. Andreou and K. Paparrizos and N. Samaras and A. Sifaleras},\r\n title = {Visualization of the network exterior primal simplex algorithm for\tthe minimum cost network flow problem},\r\n journal = {Operational Research. An International Journal},\r\n year = {2007},\r\n\tabstract = {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 independent. 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.},\r\n volume = {7},\r\n number = {3},\r\n pages = {449--464},\r\n publisher = {Springer Berlin/Heidelberg},\r\n url = {http://dx.doi.org/10.1007/BF03024857},\r\n pdf = {./papers/Visualization_software_of_the_network_exterior_primal_simplex_algorithm_for_the_minimum_cost_network_flow_problem.pdf}\r\n}\r\n\r\n","author_short":["Andreou, D.","Paparrizos, K.","Samaras, N.","Sifaleras, A."],"key":"APSS2007","id":"APSS2007","bibbaseid":"andreou-paparrizos-samaras-sifaleras-visualizationofthenetworkexteriorprimalsimplexalgorithmfortheminimumcostnetworkflowproblem-2007","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/BF03024857"},"downloads":0,"html":""},"search_terms":["visualization","network","exterior","primal","simplex","algorithm","minimum","cost","network","flow","problem","andreou","paparrizos","samaras","sifaleras"],"keywords":[],"authorIDs":["58b9fb175997d61a3f00000d"],"dataSources":["BT5gTihhNkjwKTaXa"]}