{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:30:13Z","timestamp":1649104213759},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0167-6377(02)00104-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T19:55:37Z","timestamp":1034625337000},"page":"49-56","source":"Crossref","is-referenced-by-count":0,"title":["A nontangential cutting plane algorithm"],"prefix":"10.1016","volume":"30","author":[{"given":"Siriphong","family":"Lawphongpanich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00104-9_BIB1","series-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa","year":"1993"},{"key":"10.1016\/S0167-6377(02)00104-9_BIB2","series-title":"GAMS: A User's Guide","author":"Brooke","year":"1998"},{"key":"10.1016\/S0167-6377(02)00104-9_BIB3","series-title":"Linear Programming","author":"Dantzig","year":"1997"},{"key":"10.1016\/S0167-6377(02)00104-9_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programs","volume":"8","author":"Dantzig","year":"1960","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00104-9_BIB5","unstructured":"ILOG, CPLEX 6.5 User's Manual, ILOG Incorporated, Mountain View, CA, 1999."},{"key":"10.1016\/S0167-6377(02)00104-9_BIB6","unstructured":"B.A. Murtagh, M.A. Saunder, MINOS: user's guide, Technical Report SOL 83-20R, Department of Operations Research, Stanford University, Stanford, CA, 1995."},{"key":"10.1016\/S0167-6377(02)00104-9_BIB7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/363744.363779","article-title":"Construction of nonlinear programming test problems","volume":"8","author":"Rosen","year":"1965","journal-title":"Comm. ASM"},{"key":"10.1016\/S0167-6377(02)00104-9_BIB8","series-title":"Inside Windows NT","author":"Solomon","year":"1998"},{"key":"10.1016\/S0167-6377(02)00104-9_BIB9","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/S1052623497318700","article-title":"Inexact cuts in Benders decomposition","volume":"10","author":"Zakeri","year":"2000","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0167-6377(02)00104-9_BIB10","series-title":"Nonlinear Programming: A Unified Approach","author":"Zangwill","year":"1969"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001049?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001049?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T21:53:28Z","timestamp":1556920408000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0167637702001049"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00104-9","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}