{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:27:23Z","timestamp":1648927643174},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2010,12]]},"abstract":"<jats:p> This paper introduces a new multiple pivot shortest path simplex method by choosing a subset of non-basic arcs to simultaneously enter into the basis. It is shown that the proposed shortest path simplex method requires O (n) multiple pivots and its running time is O (nm). Results from a computational study comparing the proposed method from previously known methods are reported. The experimental show that the proposed rule is more efficient than the considered shortest path simplex pivot rules. <\/jats:p>","DOI":"10.1142\/s0217595910002946","type":"journal-article","created":{"date-parts":[[2010,12,22]],"date-time":"2010-12-22T10:43:45Z","timestamp":1293014625000},"page":"677-691","source":"Crossref","is-referenced-by-count":3,"title":["SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY"],"prefix":"10.1142","volume":"27","author":[{"given":"A.","family":"SEDE\u00d1O-NODA","sequence":"first","affiliation":[{"name":"Departamento de Estad\u00edstica, Investigaci\u00f3n Operativa y Computaci\u00f3n (DEIOC), Universidad de La Laguna, 38205- La Laguna, Tenerife (Espa\u00f1a), Spain"}]},{"given":"C.","family":"GONZ\u00c1LEZ-MART\u00cdN","sequence":"additional","affiliation":[{"name":"Departamento de Estad\u00edstica, Investigaci\u00f3n Operativa y Computaci\u00f3n (DEIOC), Universidad de La Laguna, 38205- La Laguna, Tenerife (Espa\u00f1a), Spain"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume-title":"Network Flows","author":"Ahuja R.","year":"1993"},{"key":"rf3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"Bellman R.","journal-title":"Quart. of Appl. Math."},{"key":"rf4","first-page":"129","volume":"73","author":"Cherkassky B. V.","journal-title":"Mathematical Programming"},{"key":"rf5","first-page":"196","volume":"4","author":"Cunningham W. H.","journal-title":"Mathematical Programming"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.5.2.266"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090304"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.4.624"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230200108"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.3.445"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.882"},{"key":"rf14","first-page":"166","volume":"25","author":"Orlin B.","journal-title":"Mathematical Programming Study"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-008-9214-5"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595910002946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:54:57Z","timestamp":1565132097000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595910002946"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":12,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2010,12]]}},"alternative-id":["10.1142\/S0217595910002946"],"URL":"https:\/\/doi.org\/10.1142\/s0217595910002946","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}