{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:33:55Z","timestamp":1765960435970},"reference-count":11,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"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":[[1991,10]]},"DOI":"10.1016\/0167-6377(91)90042-n","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"403-409","source":"Crossref","is-referenced-by-count":68,"title":["On-line and off-line vertex enumeration by adjacency lists"],"prefix":"10.1016","volume":"10","author":[{"given":"Pey-Chun","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brigitte","family":"Jaumard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(91)90042-N_BIB1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/moor.8.3.381","article-title":"The complexity of vertex enumeration methods","volume":"8","author":"Dyer","year":"1983","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/0167-6377(91)90042-N_BIB2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/moor.1.3.251","article-title":"A successive underestimation method for concave minimization problems","volume":"1","author":"Falk","year":"1976","journal-title":"Math. Oper. Res."},{"issue":"6","key":"10.1016\/0167-6377(91)90042-N_BIB3","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1287\/opre.34.6.919","article-title":"Concave minimization via collapsing polytopes","volume":"34","author":"Falk","year":"1986","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(91)90042-N_BIB4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/BF01589330","article-title":"A method for globally minimizing concave functions over convex sets","volume":"20","author":"Hoffman","year":"1981","journal-title":"Math. Programming"},{"issue":"2","key":"10.1016\/0167-6377(91)90042-N_BIB5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-6377(88)90071-5","article-title":"On finding new vertices and redundant constraints in cutting-plane algorithms for global optimization","volume":"7","author":"Horst","year":"1988","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(91)90042-N_BIB6","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0167-6377(89)90051-5","article-title":"A new algorithm to find all vertices of a polytope","volume":"8","author":"Khang","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(91)90042-N_BIB7","volume":"Vol. 3","author":"Knuth","year":"1973"},{"issue":"2","key":"10.1016\/0167-6377(91)90042-N_BIB8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/moor.5.2.167","article-title":"A survey and comparison of methods for finding all vertices of convex polyhedral sets","volume":"5","author":"Matheiss","year":"1980","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10.1016\/0167-6377(91)90042-N_BIB9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF03167774","article-title":"Global optimization under Lipschitzian constraints","volume":"4","author":"Thach","year":"1987","journal-title":"Japan J. Appl. Math."},{"key":"10.1016\/0167-6377(91)90042-N_BIB10","first-page":"21","article-title":"An outer approximation method for globally minimizing a concave function over a compact convex set","volume":"8","author":"Thieu","year":"1983","journal-title":"Acta Math. Vietnam"},{"key":"10.1016\/0167-6377(91)90042-N_BIB11","series-title":"Fermat Days 85: Mathematics for Optimization","first-page":"273","article-title":"A general deterministic approach to global optimization via d.c. programming","author":"Tuy","year":"1986"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190042N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190042N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:27:17Z","timestamp":1552886837000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779190042N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":11,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["016763779190042N"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(91)90042-n","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}