{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T03:59:35Z","timestamp":1785211175275,"version":"3.55.0"},"reference-count":24,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2023,7,4]]},"DOI":"10.1080\/10556788.2023.2167994","type":"journal-article","created":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T15:56:26Z","timestamp":1675958186000},"page":"723-755","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":6,"title":["Outer approximation algorithms for convex vector optimization problems"],"prefix":"10.1080","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9530-7889","authenticated-orcid":false,"given":"\u0130rem Nur","family":"Keskin","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, Bilkent University, Ankara, Turkey"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0532-9927","authenticated-orcid":false,"given":"Firdevs","family":"Ulus","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Bilkent University, Ankara, Turkey"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2023,2,9]]},"reference":[{"key":"CIT0001","unstructured":"\u00c7. Ararat, S. Tekg\u00fcl, and F. Ulus, Geometric duality results and approximation algorithms for convex vector optimization problems. SIAM Journal on Optimization (to appear), pp. 1\u201331."},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-022-02045-8"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2017.0804"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008215702611"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0205-z"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2021.1880579"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-010-9588-7"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020106"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"CIT0010","unstructured":"M. Grant and S. Boyd, CVX: Matlab software for disciplined convex programming, March 2014. Available at http:\/\/cvxr.com\/cvx."},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/s11579-013-0094-9"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.05.036"},{"key":"CIT0013","volume-title":"Vector Optimization\u2013Theory, Applications, and Extensions","author":"Jahn J.","year":"2004"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1007\/s001860200217"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18351-5"},{"key":"CIT0016","unstructured":"A. L\u00f6hne and B. Wei\u00dfing, BENSOLVE: A Free VLP Solver, Version 2.0.1, 2015. Available at https:\/\/bensolve.org\/."},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.02.039"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-013-0136-0"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-50280-4"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1007\/BF00934564"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1007\/s11579-020-00282-x"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805766"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2023.2167994","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T12:34:05Z","timestamp":1689683645000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2023.2167994"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,9]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7,4]]}},"alternative-id":["10.1080\/10556788.2023.2167994"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2023.2167994","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,9]]},"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"},{"value":"2021-09-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-01-05","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}