{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T11:44:17Z","timestamp":1765885457308},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1975,4,1]],"date-time":"1975-04-01T00:00:00Z","timestamp":165542400000},"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":[[1975,4]]},"DOI":"10.1016\/0305-0548(75)90022-2","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"1-12","source":"Crossref","is-referenced-by-count":7,"title":["Allocation of police beats to patrol units to minimize response time to calls for service"],"prefix":"10.1016","volume":"2","author":[{"given":"Deepak","family":"Bammi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(75)90022-2_BIB1","article-title":"Design of police patrol beats to minimize response time to calls for service","author":"Bammi","year":"1972"},{"key":"10.1016\/0305-0548(75)90022-2_BIB2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0305-0548(74)90075-6","article-title":"Operations research and computers in law enforcement: Some case studies of American police experience","volume":"1","author":"Bottoms","year":"1974","journal-title":"Comput. & Ops Res."},{"key":"10.1016\/0305-0548(75)90022-2_BIB3","article-title":"Models for the allocation of urban police patrol forces","author":"Larson","year":"1969"},{"key":"10.1016\/0305-0548(75)90022-2_BIB4","series-title":"Urban Police Patrol Analysis","author":"Larson","year":"1972"},{"key":"10.1016\/0305-0548(75)90022-2_BIB5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0305-0548(74)90076-8","article-title":"A hypercube queueing model for facility location and redistricting in urban emergency services","volume":"1","author":"Larson","year":"1974","journal-title":"Comput. & Ops Res."},{"key":"10.1016\/0305-0548(75)90022-2_BIB6","article-title":"Deployment of varying number of emergency service units using a fixed boundary beat plan","author":"Rengarajan","year":"1972"},{"key":"10.1016\/0305-0548(75)90022-2_BIB7","series-title":"Elements of Queueing Theory","author":"Saaty","year":"1961"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054875900222?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054875900222?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:24:11Z","timestamp":1552926251000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054875900222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,4]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1975,4]]}},"alternative-id":["0305054875900222"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(75)90022-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1975,4]]}}}