{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T22:44:29Z","timestamp":1770504269307,"version":"3.49.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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 & Operations Research"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0305-0548(93)90059-r","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"723-735","source":"Crossref","is-referenced-by-count":14,"title":["An interior multiobjective linear programming algorithm"],"prefix":"10.1016","volume":"20","author":[{"given":"Ami","family":"Arbel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(93)90059-R_BIB1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0305-0548(93)90059-R_BIB2","doi-asserted-by":"crossref","DOI":"10.21236\/ADA198944","article-title":"Interior-point methods for linear programming: a challenge to the simplex method","author":"Gill","year":"1988"},{"key":"10.1016\/0305-0548(93)90059-R_BIB3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","article-title":"An implementation of Karmarkar's algorithm for linear programming","volume":"44","author":"Adler","year":"1989","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(93)90059-R_BIB4","series-title":"Progress in Mathematical Programming: Interior-Point and Related Methods","year":"1989"},{"key":"10.1016\/0305-0548(93)90059-R_BIB5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","article-title":"A modification of Karmarkar's linear programming algorithm","volume":"1","author":"Vanderbei","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0305-0548(93)90059-R_BIB6","series-title":"Multiple Criteria Optimization: Theory, Computation, and Application","author":"Steuer","year":"1986"},{"key":"10.1016\/0305-0548(93)90059-R_BIB7","series-title":"Multiple Criteria Decision Making","author":"Zeleny","year":"1982"},{"key":"10.1016\/0305-0548(93)90059-R_BIB8","series-title":"Multicriteria Decision Making: The Analytic Hierarchy Process","author":"Saaty","year":"1988"},{"key":"10.1016\/0305-0548(93)90059-R_BIB9","series-title":"The Logic of Priorities","author":"Saaty","year":"1982"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489390059R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489390059R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:25:31Z","timestamp":1552915531000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489390059R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":9,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["030505489390059R"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(93)90059-r","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}