{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T19:13:18Z","timestamp":1654110798126},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0377-2217(03)00040-7","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"500-506","source":"Crossref","is-referenced-by-count":2,"title":["Risk transportation via a clique number problem formulation"],"prefix":"10.1016","volume":"152","author":[{"given":"G.","family":"Mavrommatis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-C.","family":"Panayiotopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2000","key":"10.1016\/S0377-2217(03)00040-7_BIB1","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/S0377-2217(99)00214-3","article-title":"On finding dissimilar paths","volume":"121","author":"Akgun","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"10.1016\/S0377-2217(03)00040-7_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0895-7177(95)00092-G","article-title":"Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison","volume":"21","author":"Balakrishnan","year":"1995","journal-title":"Mathematical and Computer Modelling"},{"key":"10.1016\/S0377-2217(03)00040-7_BIB3","article-title":"The maximum clique problem","volume":"vol. 4","author":"Bonze","year":"1999"},{"key":"10.1016\/S0377-2217(03)00040-7_BIB4","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","article-title":"An exact algorithm for the maximum clique problem","volume":"9","author":"Carraghan","year":"1990","journal-title":"Operations Research Letters"},{"issue":"4","key":"10.1016\/S0377-2217(03)00040-7_BIB5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1080\/00207547308929988","article-title":"Numerical taxonomy applied to group technology and plant layout","volume":"11","author":"Carrie","year":"1973","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(03)00040-7_BIB6","series-title":"Introduction to Algorithms","author":"Cormen","year":"2000"},{"key":"10.1016\/S0377-2217(03)00040-7_BIB7","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0377-2217(03)00040-7_BIB8","unstructured":"G. Mavrommatis, NP-completeness and distributed processing, Ph.D. Dissertation, Department of Informatics, University of Piraeus, Piraeus, Greece, 2002"},{"key":"10.1016\/S0377-2217(03)00040-7_BIB9","doi-asserted-by":"crossref","unstructured":"J. McAuley, Machine grouping for efficient production, Production Engineer (February), 53\u201357, 1972","DOI":"10.1049\/tpe.1972.0006"},{"issue":"10","key":"10.1016\/S0377-2217(03)00040-7_BIB10","doi-asserted-by":"crossref","first-page":"1811","DOI":"10.1080\/00207548908942656","article-title":"An experiment investigating the application of clustering procedures and similarity coefficients to the GT machine cell formation problem","volume":"27","author":"Mosier","year":"1989","journal-title":"International Journal of Production Research"},{"issue":"2","key":"10.1016\/S0377-2217(03)00040-7_BIB11","article-title":"Catastrophe transportation programming","volume":"29","author":"Panayiotopoulos","year":"1979","journal-title":"The Journal of the Industrial Mathematics Society"},{"issue":"3","key":"10.1016\/S0377-2217(03)00040-7_BIB12","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1080\/02522667.1992.10699126","article-title":"White, gray and black operational holes: An artificial intelligence approach","volume":"13","author":"Panayiotopoulos","year":"1992","journal-title":"Journal of Information and Optimization Sciences"},{"key":"10.1016\/S0377-2217(03)00040-7_BIB13","first-page":"279","author":"Pardalos","year":"1998"},{"key":"10.1016\/S0377-2217(03)00040-7_BIB14","unstructured":"A.J. Vakharia, U. Wemmerlov, A new similarity index and clustering methodology for formation of manufacturing cells, in: Proceedings of the 1988 Annual Meeting of the Decision Sciences Institute, 1988, pp. 1075\u20131077"},{"key":"10.1016\/S0377-2217(03)00040-7_BIB15","unstructured":"C.J. Van Rijsbergen, Information Retrieval, Department of Computing Science, University of Glasgow, 1979"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703000407?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703000407?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T05:58:54Z","timestamp":1553407134000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703000407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0377221703000407"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00040-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}