{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T04:17:50Z","timestamp":1779164270342,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":4764,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0166-218x(99)00245-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:38:45Z","timestamp":1027651125000},"page":"271-279","source":"Crossref","is-referenced-by-count":144,"title":["Container ship stowage problem: complexity and connection to the coloring of circle graphs"],"prefix":"10.1016","volume":"103","author":[{"given":"Mordecai","family":"Avriel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Penn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naomi","family":"Shpirer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00245-0_BIB1","first-page":"457","article-title":"Minimizing of overstowage in containership operations","volume":"90","author":"Aslidis","year":"1990","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00245-0_BIB2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0360-8352(93)90273-Z","article-title":"Exact and approximate solutions of the container ship stowage problem","volume":"25","author":"Avriel","year":"1993","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/S0166-218X(99)00245-0_BIB3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1023\/A:1018956823693","article-title":"Stowage planning for container ships to reduce the number of shifts","volume":"76","author":"Avriel","year":"1997","journal-title":"Ann. Oper. Res. \u2013 Math. Ind. Systems"},{"key":"10.1016\/S0166-218X(99)00245-0_BIB4","first-page":"217","article-title":"Stowage container planning: a model for getting an optimal solution","volume":"B\u20135","author":"Botter","year":"1992","journal-title":"IFIP Trans. B (Application in Tech.)"},{"key":"10.1016\/S0166-218X(99)00245-0_BIB5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/PL00020912","article-title":"Scheduling trams in the morning","volume":"49","author":"Blasum","year":"1999","journal-title":"Math. Meth. Oper. Res. MMOR"},{"key":"10.1016\/S0166-218X(99)00245-0_BIB6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02579301","article-title":"Reducing prime graphs and recognizing circle graphs","volume":"7","author":"Bouchet","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(99)00245-0_BIB7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1006\/jctb.1994.1008","article-title":"Circle graphs obstruction","volume":"60","author":"Bouchet","year":"1994","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(99)00245-0_BIB8","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(99)00245-0_BIB9","doi-asserted-by":"crossref","unstructured":"S. Even, A. Itai, Queues, stacks and graphs, in: Kohavi, Paz (Eds.), Theory of Machines and Computations, Academic Press, New York, 71\u201386, 1971.","DOI":"10.1016\/B978-0-12-417750-5.50011-7"},{"key":"10.1016\/S0166-218X(99)00245-0_BIB10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/net.3230030305","article-title":"Algorithms for a maximum clique and a maximum independent set of a circle graph","volume":"3","author":"Gavril","year":"1973","journal-title":"Networks"},{"issue":"2","key":"10.1016\/S0166-218X(99)00245-0_BIB11","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","article-title":"The complexity of coloring circular arcs and chords","volume":"1","author":"Garey","year":"1980","journal-title":"SIAM J. Algebraic Disc. Meth."},{"key":"10.1016\/S0166-218X(99)00245-0_BIB12","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(99)00245-0_BIB13","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/65950.65951","article-title":"Recognizing circle graphs in polynomial time","volume":"36","author":"Gabor","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(99)00245-0_BIB14","unstructured":"R. Holzman, private communication, 1994."},{"key":"10.1016\/S0166-218X(99)00245-0_BIB15","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/net.3230110305","article-title":"Finding maximum clique in circle graphs","volume":"11","author":"Rotem","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(99)00245-0_BIB16","first-page":"370","article-title":"A computer-aided preplanning system","volume":"21","author":"Shields","year":"1984","journal-title":"Marine Technol."},{"key":"10.1016\/S0166-218X(99)00245-0_BIB17","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1006\/jagm.1994.1012","article-title":"Recognition of circle graphs","volume":"16","author":"Spinrad","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(99)00245-0_BIB18","doi-asserted-by":"crossref","unstructured":"W. Unger, On the k-coloring of circle graphs, Proceedings of STACS 88, Lecture Notes in Computer Science, Vol. 294, Springer, Berlin, 1988, pp. 61\u201372.","DOI":"10.1007\/BFb0035832"},{"key":"10.1016\/S0166-218X(99)00245-0_BIB19","doi-asserted-by":"crossref","unstructured":"W. Unger, The complexity of coloring circle graphs, Proceedings of STACS 92, Lecture Notes in Computer Science, Vol. 577, Springer, Berlin, 1992, pp. 389\u2013400.","DOI":"10.1007\/3-540-55210-3_199"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002450?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002450?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T04:33:05Z","timestamp":1681705985000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99002450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0166218X99002450"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00245-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}