{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:44:51Z","timestamp":1740138291996,"version":"3.37.3"},"reference-count":9,"publisher":"Informa UK Limited","issue":"6","funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["Grant-in-Aid for Science Research (A) 26242027"],"award-info":[{"award-number":["Grant-in-Aid for Science Research (A) 26242027"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1080\/10556788.2016.1208748","type":"journal-article","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T14:57:22Z","timestamp":1468940242000},"page":"1298-1304","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":3,"title":["The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption"],"prefix":"10.1080","volume":"31","author":[{"given":"S.","family":"Mizuno","sequence":"first","affiliation":[]}],"member":"301","published-online":{"date-parts":[[2016,7,19]]},"reference":[{"key":"CIT0001","first-page":"17","volume":"80","author":"Armstrong R.D.","year":"1998","journal-title":"Math. Prog."},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.2.103"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.12.001"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"CIT0006","first-page":"191","volume":"20","author":"Khachiyan L. G.","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2012.01.004"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0482-y"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.2.250"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1110.0516"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2016.1208748","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,16]],"date-time":"2016-12-16T17:56:40Z","timestamp":1481911000000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2016.1208748"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,19]]},"references-count":9,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2016,5,2]]},"published-print":{"date-parts":[[2016,11]]}},"alternative-id":["10.1080\/10556788.2016.1208748"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2016.1208748","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2016,7,19]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}