{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:34:00Z","timestamp":1720694040507},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1977,12,1]],"date-time":"1977-12-01T00:00:00Z","timestamp":249782400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1977,12]]},"DOI":"10.1007\/bf01593795","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T20:13:01Z","timestamp":1114719181000},"page":"285-288","source":"Crossref","is-referenced-by-count":10,"title":["Testing for complete efficiency in a vector maximization problem"],"prefix":"10.1007","volume":"12","author":[{"given":"Mathilde","family":"Benveniste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF01580453","volume":"8","author":"J.G. Ecker","year":"1975","unstructured":"J.G. Ecker and I.A. Kouada, \u201cFinding all efficient extreme points for multiple objective linear programs\u201d,Mathematical Programming 8 (1975) 375\u2013377.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01584543","volume":"2","author":"J. Philip","year":"1972","unstructured":"J. Philip, \u201cAlgorithms for a vector maximization problem\u201d,Mathematical Programming 2 (1972) 207\u2013228.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/0022-247X(75)90189-4","volume":"49","author":"P.L. Yu","year":"1975","unstructured":"P.L. Yu and M. Zeleny, \u201cThe set of all nondominated solutions in linear cases and a multicriteria simplex method\u201d,Journal of Mathematical Analysis and Applications 49 (1975) 430\u2013468.","journal-title":"Journal of Mathematical Analysis and Applications"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593795.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01593795\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:48:02Z","timestamp":1556898482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01593795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,12]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,12]]}},"alternative-id":["BF01593795"],"URL":"https:\/\/doi.org\/10.1007\/bf01593795","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,12]]}}}