{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:30:13Z","timestamp":1649147413533},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,31]],"date-time":"2007-10-31T00:00:00Z","timestamp":1193788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s10589-007-9144-7","type":"journal-article","created":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T16:59:18Z","timestamp":1193763558000},"page":"437-448","source":"Crossref","is-referenced-by-count":1,"title":["New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels"],"prefix":"10.1007","volume":"43","author":[{"given":"A.","family":"Sede\u00f1o-Noda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Gonz\u00e1lez-Mart\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,31]]},"reference":[{"key":"9144_CR1","volume-title":"Network Flows","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.B.: Network Flows. Prentice Hall, New York (1993)"},{"key":"9144_CR2","unstructured":"Akgul, M.: Shortest paths and the simplex method. Technical Report, Department of Computer Sciences and Operations Research Program, North Carolina State University, Raleigh, NC (1986)"},{"key":"9144_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. Bellman","year":"1958","unstructured":"Bellman, R.: On a route problem. Q. Appl. Math. 16, 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"key":"9144_CR4","first-page":"129","volume":"73","author":"B.V. Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73, 129\u2013174 (1996)","journal-title":"Math. Program."},{"key":"9144_CR5","first-page":"196","volume":"4","author":"W.H. Cunningham","year":"1979","unstructured":"Cunningham, W.H.: Theoretical properties of the network simplex method. Math. Program. 4, 196\u2013208 (1979)","journal-title":"Math. Program."},{"key":"9144_CR6","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"G.B. Dantzig","year":"1957","unstructured":"Dantzig, G.B.: Discrete-variable extremum principles. Oper. Res. 5, 266\u2013277 (1957)","journal-title":"Oper. Res."},{"key":"9144_CR7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.3230090304","volume":"9","author":"R. Dial","year":"1979","unstructured":"Dial, R., Glover, F., Karney, D., Klingman, D.: A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks 9, 215\u2013248 (1979)","journal-title":"Networks"},{"key":"9144_CR8","unstructured":"Ford, L.R.: Network flow theory. The Rand Corporation Report P-923, Santa Monica, Calif (1956)"},{"issue":"3","key":"9144_CR9","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/opre.47.3.445","volume":"47","author":"D. Goldfarb","year":"1999","unstructured":"Goldfarb, D., Jin, Z.: An O(nm)-time network simplex algorithm for the shortest path problem. Oper. Res. 47(3), 445\u2013448 (1999)","journal-title":"Oper. Res."},{"issue":"4","key":"9144_CR10","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1287\/opre.38.4.624","volume":"38","author":"D. Goldfarb","year":"1990","unstructured":"Goldfarb, D., Hao, J., Kai, S.R.: Efficient shortest path simplex algorithms. Oper. Res. 38(4), 624\u2013628 (1990)","journal-title":"Oper. Res."},{"key":"9144_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/net.3230200108","volume":"20","author":"D. Goldfarb","year":"1990","unstructured":"Goldfarb, D., Hao, J., Kai, S.R.: Anti-stalling pivot rules for the network simplex algorithm. Networks 20, 79\u201391 (1990)","journal-title":"Networks"},{"key":"9144_CR12","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1287\/opre.6.6.882","volume":"6","author":"G.J. Minty","year":"1958","unstructured":"Minty, G.J.: A variant on the shortest route problem. Oper. Res. 6, 882 (1958)","journal-title":"Oper. Res."},{"key":"9144_CR13","unstructured":"Moore, Z.F.: The shortest path through a maze. In: Proceedings of the International Symposium on Theory of Switching, Part II, pp.\u00a0285\u2013292 (1957)"},{"key":"9144_CR14","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/BFb0121050","volume":"25","author":"B. Orlin","year":"1985","unstructured":"Orlin, B.: On the simplex algorithm for networks and generalized networks. Math. Program. Study 25, 166\u2013178 (1985)","journal-title":"Math. Program. Study"},{"issue":"4","key":"9144_CR15","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/j.future.2004.09.001","volume":"21","author":"K. Subramani","year":"2005","unstructured":"Subramani, K., Kovalchick, L.: A greedy strategy for detecting negative cost cycles in networks. Future Gener. Comput. Syst. 21(4), 607\u2013623 (2005)","journal-title":"Future Gener. Comput. Syst."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9144-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9144-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9144-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:34Z","timestamp":1559302594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9144-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,31]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["9144"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9144-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,31]]}}}