{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T07:36:05Z","timestamp":1683272165988},"reference-count":15,"publisher":"Informa UK Limited","issue":"12","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2017,12,2]]},"DOI":"10.1080\/00207160.2017.1283020","type":"journal-article","created":{"date-parts":[[2017,1,30]],"date-time":"2017-01-30T01:18:36Z","timestamp":1485739116000},"page":"2271-2282","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":6,"title":["An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the <b>N\u221e\u2212<\/b> neighbourhood of the central path"],"prefix":"10.1080","volume":"94","author":[{"given":"B.","family":"Kheirfam","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2017,2,14]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1137\/040604492"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.2298\/YJOR130515034A"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-013-0457-7"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-015-0884-5"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-015-0005-7"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54509-3"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1137\/120884341"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1137\/080716979"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1137\/040606557"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1137\/050623917"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2009.07.014"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-013-0281-0"},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"X. Yang, Y. Zhang, and H. Liu, A wide neighborhood infeasible-interior-point method with arc-search for linear programming, J. Appl. Math. Comput. (2015). doi: 10.1007\/s12190-015-0900-z.","DOI":"10.1007\/s12190-015-0900-z"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1137\/0804012"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160.2017.1283020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T00:47:10Z","timestamp":1510620430000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207160.2017.1283020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,14]]},"references-count":15,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2017,2,6]]},"published-print":{"date-parts":[[2017,12,2]]}},"alternative-id":["10.1080\/00207160.2017.1283020"],"URL":"https:\/\/doi.org\/10.1080\/00207160.2017.1283020","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,14]]},"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=gcom20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}