{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:47:43Z","timestamp":1749221263459},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0305-0548(99)00058-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:00:05Z","timestamp":1027652405000},"page":"383-398","source":"Crossref","is-referenced-by-count":8,"title":["The column-circular, subsets-selection problem: complexity and solutions"],"prefix":"10.1016","volume":"27","author":[{"given":"Fayez F.","family":"Boctor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Renaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(99)00058-1_BIB1","doi-asserted-by":"crossref","unstructured":"Foster BA, Ryan DM. An integer programming approach to the vehicle scheduling problem. Journal of the Operational Research Society 1976;27(3):367\u201384.","DOI":"10.1057\/jors.1976.63"},{"key":"10.1016\/S0305-0548(99)00058-1_BIB2","doi-asserted-by":"crossref","unstructured":"Gondran M. Des algorithmes lin\u00e9aires pour les probl\u00e8mes de partition, de recouvrement et de couplage dans les hypergraphes d'intervalles. R.A.I.R.O. Recherche Op\u00e9rationnelle 1979;13(1):13\u201321.","DOI":"10.1051\/ro\/1979130100131"},{"key":"10.1016\/S0305-0548(99)00058-1_BIB3","unstructured":"Schrijver A. Theory of linear and integer programming. New York: Wiley, 1986."},{"key":"10.1016\/S0305-0548(99)00058-1_BIB4","doi-asserted-by":"crossref","unstructured":"Veinott AF, Wagner HM. Optimal capacity scheduling-I and II. Operations Research 1962;10:518\u201346.","DOI":"10.1287\/opre.10.4.518"},{"key":"10.1016\/S0305-0548(99)00058-1_BIB5","doi-asserted-by":"crossref","unstructured":"Segal M. The operator scheduling problem: a network-flow approach. Operations Research 1974;22(4):808\u201323.","DOI":"10.1287\/opre.22.4.808"},{"key":"10.1016\/S0305-0548(99)00058-1_BIB6","doi-asserted-by":"crossref","unstructured":"Shepardson F, Marsten RE. A Lagrangian relaxation algorithm for the two-duty period scheduling problem. Management Science 1980;26(3):274\u201381.","DOI":"10.1287\/mnsc.26.3.274"},{"key":"10.1016\/S0305-0548(99)00058-1_BIB7","doi-asserted-by":"crossref","unstructured":"Darby-Dowman K, Mitra G. An extension of set partitioning with application to scheduling problems. European Journal of Operations Research 1985;21(2):200\u20135.","DOI":"10.1016\/0377-2217(85)90031-1"},{"key":"10.1016\/S0305-0548(99)00058-1_BIB8","doi-asserted-by":"crossref","unstructured":"Ryan DM, Hjorring C, Glover F. Extensions of the petal method for vehicle routing. Journal of the Operational Research Society 1993;44(3):289\u201396.","DOI":"10.1057\/jors.1993.54"},{"key":"10.1016\/S0305-0548(99)00058-1_BIB9","unstructured":"Boctor FF, Renaud J. Optimal solution of column-circular set-partitioning problems. Working paper 93-27, Facult\u00e9 des Sciences de l'Administration, Universit\u00e9 Laval, 1993."},{"key":"10.1016\/S0305-0548(99)00058-1_BIB10","doi-asserted-by":"crossref","unstructured":"Bartholdi JJ, Orlin JB, Ratliff HD. Cyclic scheduling via integer programming with circular ones. Operations Research 1980;28(5):1074\u201385.","DOI":"10.1287\/opre.28.5.1074"},{"key":"10.1016\/S0305-0548(99)00058-1_BIB11","unstructured":"Wagner HM. Principles of operations research. Englewood Cliffs, NJ: Prentice-Hall, 1969."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000581?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000581?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:23:37Z","timestamp":1580883817000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054899000581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0305054899000581"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(99)00058-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}