{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:43:11Z","timestamp":1648762991988},"reference-count":32,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1051\/ro\/2012015","type":"journal-article","created":{"date-parts":[[2012,9,7]],"date-time":"2012-09-07T10:12:19Z","timestamp":1347012739000},"page":"211-234","source":"Crossref","is-referenced-by-count":6,"title":["On a dual network exterior point simplex type algorithm and its computational behavior"],"prefix":"10.1051","volume":"46","author":[{"given":"George","family":"Geranis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Paparrizos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Sifaleras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2012,9,7]]},"reference":[{"key":"R1","unstructured":"R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network flows : theory, algorithms and applications. Prentice Hall, Englewood Cliffs, NJ (1993)."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Ahuja R.K., Magnanti T.L., Orlin J.B. and Reddy M., Applications of network optimization.Handbooks of Operations Research and Management Science7(1995) 1\u201383.","DOI":"10.1016\/S0927-0507(05)80118-5"},{"key":"R3","unstructured":"Andreou D., Paparrizos K., Samaras N. and Sifaleras A., Visualization of the network exterior primal simplex algorithm for the minimum cost network flow problem.Oper. Res.7(2007) 449\u2013464."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Baloukas Th., Paparrizos K. and Sifaleras A., An animated demonstration of the uncapacitated network simplex algorithm.ITE10(2009) 34\u201340.","DOI":"10.1287\/ited.1090.0026"},{"key":"R5","unstructured":"D.P. Bertsekas and P. Tseng,RELAX-IV : A faster version of the RELAX code for solving minimum cost flow problems. Technical Report, Massachusetts Institute of Technology, Laboratory for Information and Decision Systems (1994)."},{"key":"R6","unstructured":"Chakraborty S. and Choudhury P.P., A statistical analysis of an algorithm\u2019s complexity.Appl. Math. Lett.13(2000) 121\u2013126."},{"key":"R7","unstructured":"Coffin M. and Saltzman M.J., Statistical Analysis of computational tests of algorithms and heuristics.INFORMS J. Comput.12(2000) 24\u201344."},{"key":"R8","unstructured":"Cotta C. and Moscato P., A mixed evolutionary-statistical analysis of an algorithm\u2019s complexity.Appl. Math. Lett.16(2003) 41\u201347."},{"key":"R9","unstructured":"Ervolina T.R. and McCormick S.T., Two strongly polynomial cut canceling algorithms for minimum cost network flow.Discr. Appl. Math.46(1993) 133\u2013165."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Fredman M. and Tarjan R., Fibonacci heaps and their uses in improved network optimization algorithms.J. ACM34(1987) 596\u2013615.","DOI":"10.1145\/28869.28874"},{"key":"R11","unstructured":"Fukuda K. and Terlaky T., Criss-cross methods : a fresh view on pivot algorithms.Math. Program.79(1997) 369\u2013395."},{"key":"R12","unstructured":"Geranis G., Paparrizos K. and Sifaleras A., A dual exterior point simplex type algorithm for the minimum cost network flow problem.Yugosl. J. Oper. Res.19(2009) 157\u2013170."},{"key":"R13","unstructured":"G. Geranis, K. Paparrizos and A. Sifaleras, On the Computational Behavior of a Dual Network Exterior Point Simplex Algorithm for the Minimum Cost Network Flow Problem, inProceedings of the International Network Optimization Conference (INOC 2009). Pisa, Italy (2009)."},{"key":"R14","unstructured":"Glover F., Klingman D. and Napier A., Basic dual feasible solutions for a class of generalized networks.Oper. Res.20(1972) 126\u2013136."},{"key":"R15","unstructured":"Glover F., Karney D. and Klingman D., The augmented predecessor index method for locating stepping stone paths and assigning dual prices in distribution problems.Transp. Sci.6(1972) 171\u2013180."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"F. Glover, D. Klingman and N. Phillips,Network models in optimization and their applications in practice. Wiley Publications (1992).","DOI":"10.1002\/9781118033173"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Goldberg A.V., An Efficient Implementation of a scaling minimum-cost flow algorithm.J. Algorithms22(1997) 1\u201329.","DOI":"10.1006\/jagm.1995.0805"},{"key":"R18","unstructured":"Goldberg A., Grigoriadis M. and Tarjan R.E., Use of dynamic trees in a network simplex algorithm for the maximum flow problem,Math. Program.50(1991) 277\u2013290."},{"key":"R19","unstructured":"Grigoriadis M., An efficient implementation of the network simplex method.Math. Program. Stud.26(1984) 83\u2013111."},{"key":"R20","unstructured":"Hultz J. and Klingman D., An advanced dual basic feasible solution for a class of capacitated generalized networks.Oper. Res.24(1976) 301\u2013313."},{"key":"R21","unstructured":"J. Kennington and R. Helgason,Algorithms for network programming. Wiley, New York (1980)."},{"key":"R22","unstructured":"Klingman D., Napier A. and Stutz J., NETGEN : a program for generating large scale capacitated assignment, transportation, and minimum cost flow networks.Manag. Sci.20(1974) 814\u2013821."},{"key":"R23","unstructured":"Maros I., A practical anti-degeneracy row selection technique in network linear programming.Ann. Oper. Res.47(1993) 431\u2013442."},{"key":"R24","unstructured":"McGeoch C.C., Toward an experimental method for algorithm simulation.INFORMS J. Comput.8(1996) 1\u201315."},{"key":"R25","unstructured":"Nance R., Moose R. and Foutz R., A statistical technique for comparing heuristics : an example from capacity assignment strategies in computer network design.Commun. ACM30(1987) 430\u2013442."},{"key":"R26","unstructured":"J.B. Orlin,Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem. Technical Report No. 1615-84, Sloan School of Management, M.I.T., Cambridge, MA (1984)."},{"key":"R27","unstructured":"Paparrizos K., Samaras N. and Sifaleras A., An exterior simplex type algorithm for the minimum cost network flow problem.Comput. Oper. Res.36(2009) 1176\u20131190."},{"key":"R28","unstructured":"M. Resende and G. Veiga, An efficient implementation of a network interior point method, inNetwork flows and matching : first DIMACS implementation challenge12, edited by D.S. Johnson and C.C. McGeoch. DIMACS series in discrete mathematics and theoretical computer science, American Mathematical Society, Providence, Rhode Island (1993) 299\u2013348."},{"key":"R29","unstructured":"Tarjan R.E., Dynamic trees as search treesviaEuler tours, applied to the network simplex algorithm.Math. Program.78(1997) 169\u2013177."},{"key":"R30","unstructured":"R. Vanderbei,Linear programming : foundations and extensions, 3rd edition. Springer, New York (2007)."},{"key":"R31","unstructured":"Zadeh N., More pathological examples for network flow problems.Math. Program.5(1973) 217\u2013224."},{"key":"R32","unstructured":"Zadeh N., A bad network problem for the simplex method and other minimum cost flow algorithms.Math. Programm.5(1973) 255\u2013266."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2012015\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T15:33:47Z","timestamp":1562168027000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2012015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":32,"journal-issue":{"issue":"3"},"alternative-id":["ro120015"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2012015","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}