{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T12:08:32Z","timestamp":1775650112211,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1016\/0305-0548(93)90080-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"363-370","source":"Crossref","is-referenced-by-count":4,"title":["Finding the closest point to the origin in the convex hull of a discrete set of points"],"prefix":"10.1016","volume":"20","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyunghyun","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(93)90080-3_BIB1","series-title":"Nonsmooth Optimization: Proceedings of IIASA Workshop","first-page":"79","article-title":"Bundle methods in nonsmooth optimization","author":"Lemarachal","year":"1978"},{"key":"10.1016\/0305-0548(93)90080-3_BIB2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","article-title":"Proximality control in bundle methods for convex nondifferentiable minimization","volume":"46","author":"Kiewiel","year":"1990","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(93)90080-3_BIB3","series-title":"Integer and Nonlinear Programming","article-title":"Linear least squares and quadratic programming","author":"Golub","year":"1970"},{"key":"10.1016\/0305-0548(93)90080-3_BIB4","series-title":"An exterior point, polytope sliding and deformation algorithm for linear programming problems","author":"Choi","year":"1989"},{"key":"10.1016\/0305-0548(93)90080-3_BIB5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0312003","article-title":"Finding the point of a polyhedron closest to the origin","volume":"12","author":"Mitchell","year":"1974","journal-title":"SIAM J. Contr."},{"key":"10.1016\/0305-0548(93)90080-3_BIB6","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01580381","article-title":"Finding the nearest point in a polytope","volume":"11","author":"Wolfe","year":"1976","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(93)90080-3_BIB7","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0022-247X(78)90180-4","article-title":"An algorithm for finding the shortest element of a polytope set with application to Lagrangian duality","volume":"65","author":"Bazaraa","year":"1978","journal-title":"J. Math. Anal. Applic."},{"key":"10.1016\/0305-0548(93)90080-3_BIB8","series-title":"Linear and Nonlinear Programming","author":"Luenberger","year":"1984"},{"key":"10.1016\/0305-0548(93)90080-3_BIB9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","article-title":"Interior path following primal-dual algorithms\u2014part II: convex quadratic programming","volume":"44","author":"Monteiro","year":"1989","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(93)90080-3_BIB10","series-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa","year":"1993"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054893900803?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054893900803?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:24:35Z","timestamp":1552929875000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054893900803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["0305054893900803"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(93)90080-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}