@ARTICLE{GPS2009a,
  author = {G. Geranis and K. Paparrizos and A. Sifaleras},
  title = {A dual exterior point simplex type algorithm for the minimum cost network flow problem},
  journal = {Yugoslav Journal of Operations Research},
  year = {2009},
  volume = {19},
  number = {1},
  pages = {157--170},
	url = {http://dx.doi.org/10.2298/YJOR0901157G},
	abstract = {A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special ``exterior- point simplex type'' category. Similarly to the classical network dual simplex algorithm (NDSA), this algorithm starts with a dual feasible tree-solution and reduces the primal infeasibility, iteration by iteration. However, contrary to the NDSA, the new algorithm does not always maintain a dual feasible solution. Instead, the new algorithm might reach a basic point (tree-solution) outside the dual feasible area (exterior point - dual infeasible tree).}
}

{"_id":"BFxLuPz62bRNC2q6E","bibbaseid":"geranis-paparrizos-sifaleras-adualexteriorpointsimplextypealgorithmfortheminimumcostnetworkflowproblem-2009","downloads":0,"creationDate":"2017-03-04T23:23:11.914Z","title":"A dual exterior point simplex type algorithm for the minimum cost network flow problem","author_short":["Geranis, G.","Paparrizos, K.","Sifaleras, A."],"year":2009,"bibtype":"article","biburl":"http://users.uom.gr/~sifalera/my_publications.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["G."],"propositions":[],"lastnames":["Geranis"],"suffixes":[]},{"firstnames":["K."],"propositions":[],"lastnames":["Paparrizos"],"suffixes":[]},{"firstnames":["A."],"propositions":[],"lastnames":["Sifaleras"],"suffixes":[]}],"title":"A dual exterior point simplex type algorithm for the minimum cost network flow problem","journal":"Yugoslav Journal of Operations Research","year":"2009","volume":"19","number":"1","pages":"157--170","url":"http://dx.doi.org/10.2298/YJOR0901157G","abstract":"A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special ``exterior- point simplex type'' category. Similarly to the classical network dual simplex algorithm (NDSA), this algorithm starts with a dual feasible tree-solution and reduces the primal infeasibility, iteration by iteration. However, contrary to the NDSA, the new algorithm does not always maintain a dual feasible solution. Instead, the new algorithm might reach a basic point (tree-solution) outside the dual feasible area (exterior point - dual infeasible tree).","bibtex":"@ARTICLE{GPS2009a,\r\n author = {G. Geranis and K. Paparrizos and A. Sifaleras},\r\n title = {A dual exterior point simplex type algorithm for the minimum cost network flow problem},\r\n journal = {Yugoslav Journal of Operations Research},\r\n year = {2009},\r\n volume = {19},\r\n number = {1},\r\n pages = {157--170},\r\n\turl = {http://dx.doi.org/10.2298/YJOR0901157G},\r\n\tabstract = {A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special ``exterior- point simplex type'' category. Similarly to the classical network dual simplex algorithm (NDSA), this algorithm starts with a dual feasible tree-solution and reduces the primal infeasibility, iteration by iteration. However, contrary to the NDSA, the new algorithm does not always maintain a dual feasible solution. Instead, the new algorithm might reach a basic point (tree-solution) outside the dual feasible area (exterior point - dual infeasible tree).}\r\n}\r\n\r\n","author_short":["Geranis, G.","Paparrizos, K.","Sifaleras, A."],"key":"GPS2009a","id":"GPS2009a","bibbaseid":"geranis-paparrizos-sifaleras-adualexteriorpointsimplextypealgorithmfortheminimumcostnetworkflowproblem-2009","role":"author","urls":{"Paper":"http://dx.doi.org/10.2298/YJOR0901157G"},"downloads":0,"html":""},"search_terms":["dual","exterior","point","simplex","type","algorithm","minimum","cost","network","flow","problem","geranis","paparrizos","sifaleras"],"keywords":[],"authorIDs":[],"dataSources":["BT5gTihhNkjwKTaXa"]}