{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:49:50Z","timestamp":1648752590857},"reference-count":36,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1976,12,1]],"date-time":"1976-12-01T00:00:00Z","timestamp":218246400000},"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":[[1976,12]]},"DOI":"10.1016\/0305-0548(76)90010-1","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"269-282","source":"Crossref","is-referenced-by-count":3,"title":["Environmental inspection routes and the constrained travelling system salesman problem"],"prefix":"10.1016","volume":"3","author":[{"given":"John J.","family":"Dinkel","sequence":"first","affiliation":[]},{"given":"G.B.","family":"Kleindorfer","sequence":"additional","affiliation":[]},{"given":"G.A.","family":"Kochenberger","sequence":"additional","affiliation":[]},{"given":"S.-N.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(76)90010-1_BIB1","series-title":"Integer Programming","author":"Garfinkel","year":"1972"},{"key":"10.1016\/0305-0548(76)90010-1_BIB2","series-title":"Integer Programming and Network Flows","author":"Hu","year":"1969"},{"key":"10.1016\/0305-0548(76)90010-1_BIB3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/opre.16.3.538","article-title":"The traveling salesman problem: a survey","volume":"16","author":"Bellmore","year":"1968","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(76)90010-1_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/321105.321111","article-title":"Dynamic programming treatment of the traveling salesman problem","volume":"9","author":"Bellman","year":"1962","journal-title":"J. Assoc. Corny. Mach."},{"key":"10.1016\/0305-0548(76)90010-1_BIB5","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1287\/opre.19.2.278","article-title":"Pathology of traveling salesman subtour elimination procedures","volume":"19","author":"Bellmore","year":"1971","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(76)90010-1_BIB6","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1287\/opre.20.5.1044","article-title":"Bounds for the traveling salesman problem","volume":"20","author":"Christofides","year":"1972","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(76)90010-1_BIB7","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","article-title":"Branch and bound methods: a survey","volume":"14","author":"Lawler","year":"1966","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(76)90010-1_BIB8","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell Systems Techn. J."},{"key":"10.1016\/0305-0548(76)90010-1_BIB9","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(76)90010-1_BIB10","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the traveling salesman problem","volume":"11","author":"Little","year":"1963","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(76)90010-1_BIB11","first-page":"196","article-title":"A dynamic programming approach to sequencing problems","author":"Held","year":"1962","journal-title":"J. SIAM"},{"key":"10.1016\/0305-0548(76)90010-1_BIB12","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(76)90010-1_BIB13","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees","volume":"1","author":"Held","year":"1971","journal-title":"Mathematical Programming"},{"key":"10.1016\/0305-0548(76)90010-1_BIB14","series-title":"Principles of Operations Research","author":"Wagner","year":"1969"},{"key":"10.1016\/0305-0548(76)90010-1_BIB15","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Mgt Sci."},{"key":"10.1016\/0305-0548(76)90010-1_BIB16","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clark","year":"1964","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(76)90010-1_BIB17","series-title":"Efficient routing systems for retail milk delivery","author":"Hallberg","year":"1970"},{"key":"10.1016\/0305-0548(76)90010-1_BIB18","article-title":"Designing efficient pick up and delivery route systems by computer","author":"Hallberg","year":"1972","journal-title":"Department of Agricultural Economics and Rural Sociology, Agricultural Experimental Station, The Pennsylvania State University, University Park, Pennsylvania, Bulletin 782"},{"key":"10.1016\/0305-0548(76)90010-1_BIB19","doi-asserted-by":"crossref","DOI":"10.1287\/trsc.6.2.137","article-title":"Optimal bus scheduling","volume":"6","author":"Salzborn","year":"1972","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(76)90010-1_BIB20","article-title":"A note on fleet routing models for transportation systems","volume":"7","author":"Salzborn","year":"1973","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(76)90010-1_BIB21","doi-asserted-by":"crossref","first-page":"854","DOI":"10.2307\/1237623","article-title":"The Lockset method of sequential programming applied to routing delivery and pick-up trucks","volume":"50","author":"Schruben","year":"1968","journal-title":"Am. J. Agric. Econ."},{"key":"10.1016\/0305-0548(76)90010-1_BIB22","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1080\/05695557408974967","article-title":"Transportation routing problem\u2014a survey","volume":"6","author":"Turner","year":"1974","journal-title":"AIIE Trans."},{"key":"10.1016\/0305-0548(76)90010-1_BIB23","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulations and traveling salesman problems","volume":"8","author":"Miller","year":"1960","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0305-0548(76)90010-1_BIB24","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1287\/opre.10.5.647","article-title":"On the relation between the traveling salesman and the longest path problem","volume":"10","author":"Hardgrave","year":"1962","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(76)90010-1_BIB25","doi-asserted-by":"crossref","DOI":"10.1109\/SWAT.1974.4","article-title":"Approximate algorithms for the traveling salesperson problem","author":"Rosenkrantz","year":"1974"},{"key":"10.1016\/0305-0548(76)90010-1_BIB26","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1287\/mnsc.11.8.B166","article-title":"Three heuristic rules for sequencing jobs to a single production facility","volume":"11","author":"Gavett","year":"1965","journal-title":"Mgt Sci."},{"key":"10.1016\/0305-0548(76)90010-1_BIB27","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1057\/jors.1967.44","article-title":"Bases for vehicle fleet scheduling","volume":"18","author":"Gaskell","year":"1967","journal-title":"Opl. Res. Q."},{"key":"10.1016\/0305-0548(76)90010-1_BIB28","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","article-title":"A heuristic algorithm for the vehicle dispatch problem","volume":"22","author":"Gillett","year":"1974","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(76)90010-1_BIB29","series-title":"Operations Research Conference","article-title":"The use of a heuristic tree-search algorithm for vehicle routing and scheduling","author":"Knowles","year":"1967"},{"key":"10.1016\/0305-0548(76)90010-1_BIB30","first-page":"354","article-title":"A heuristic approach for solving the delivery problem","volume":"19","author":"Tillman","year":"1968","journal-title":"J. Ind. Engng"},{"key":"10.1016\/0305-0548(76)90010-1_BIB31","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1287\/mnsc.19.7.790","article-title":"Computational experience with an M-salesman traveling salesman algorithm","volume":"19","author":"Svestka","year":"1973","journal-title":"Mgt Sci."},{"key":"10.1016\/0305-0548(76)90010-1_BIB32","series-title":"Finite Graphs and Networks","author":"Busacher","year":"1965"},{"key":"10.1016\/0305-0548(76)90010-1_BIB33","series-title":"Computer Models in OR","author":"Harris","year":"1975"},{"key":"10.1016\/0305-0548(76)90010-1_BIB34","article-title":"Office location in region V of Bureau of Air Quality","author":"Dinkel","year":"1975","journal-title":"Report submitted to the Pennsylvania Department of Environmental Resources"},{"key":"10.1016\/0305-0548(76)90010-1_BIB35","article-title":"Environmental inspection routes, an operations research approach","author":"Dinkel","year":"1975","journal-title":"Report submitted to the Pennsylvania Department of Environmental Resources"},{"key":"10.1016\/0305-0548(76)90010-1_BIB36","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/mnsc.16.1.67","article-title":"A branch and bound algorithm for multilevel fixed change problems","volume":"16","author":"Jones","year":"1969","journal-title":"Mgt Sci."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054876900101?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054876900101?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:25:23Z","timestamp":1552926323000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054876900101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,12]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1976,12]]}},"alternative-id":["0305054876900101"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(76)90010-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1976,12]]}}}