{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:22:09Z","timestamp":1648981329945},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00241-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"191-204","source":"Crossref","is-referenced-by-count":0,"title":["Convexity and global optimization: a theoretical link"],"prefix":"10.1016","volume":"263","author":[{"given":"A.","family":"Quilliot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00241-3_BIB1","series-title":"Graphes et hypergraphes","author":"Berge","year":"1974"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.5.3.321","article-title":"Converting linear programs to network problems","volume":"5","author":"Bixby","year":"1980","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(00)00241-3_BIB3","series-title":"Processus stochastiques, leurs graphes et usages","author":"Chretienne","year":"1974"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB4","series-title":"Linear programming","author":"Chvatal","year":"1983"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB5","series-title":"Th\u00e9orie des processus Markoviens","author":"Dynkin","year":"1963"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB6","series-title":"Progress in Combinatorial optimization","first-page":"117","article-title":"Total dual integrality of linear inequality systems","author":"Edmonds","year":"1984"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB7","series-title":"An introduction to probability theory and its applications","author":"Feller","year":"1957"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB8","series-title":"Gessamelte Abhandlungen herausgegeben von J.P. Serre","author":"Frobenius","year":"1968"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB9","series-title":"Computer and intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(79)90018-1","article-title":"Total dual integrality and integer polyedra","volume":"25","author":"Giles","year":"1979","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"10.1016\/S0304-3975(00)00241-3_BIB11","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"issue":"1","key":"10.1016\/S0304-3975(00)00241-3_BIB12","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0304-3975(00)00241-3_BIB13","series-title":"Linear inequalities and related systems","first-page":"223","article-title":"Integral boundary points of convex polyedra","author":"Hoffman","year":"1956"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB14","series-title":"Finite Markov chains","author":"Kemeny","year":"1960"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB15","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachian","year":"1980","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"10.1016\/S0304-3975(00)00241-3_BIB16","series-title":"Optimization by simulated annealing, RC 9355, 4\/2\/82, Computer Science\/Engineering technology","author":"Kirkpatrick","year":"1982"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB17","series-title":"Combinatorial optimization, Chs. 3\u20135;","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB18","series-title":"Heuristics","author":"Pearl","year":"1986"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB19","series-title":"Optimisation Combinatoire","author":"Sakarovitch","year":"1984"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB20","series-title":"Theory of Linear and Integer Programming, Chs. 19, 20","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0304-3975(00)00241-3_BIB21","first-page":"935","article-title":"Genetic transfer algorithms for multi-vehicle routing and scheduling problems","volume":"4","author":"Thomson","year":"1989","journal-title":"Oper. Res."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002413?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002413?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T10:21:31Z","timestamp":1556792491000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002413"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00241-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}