{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T10:56:16Z","timestamp":1756896976613},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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":[[1992,2]]},"DOI":"10.1016\/0305-0548(92)90086-k","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"123-131","source":"Crossref","is-referenced-by-count":4,"title":["Minisum and minimax paths of a moving facility on a network"],"prefix":"10.1016","volume":"19","author":[{"given":"Seong-in","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heung-Sun","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(92)90086-K_BIB1","series-title":"Facilities Layout and Location","author":"Francis","year":"1974"},{"key":"10.1016\/0305-0548(92)90086-K_BIB2","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/mnsc.29.4.498","article-title":"Location on networks: a survey, part II: Exploiting tree network structure","volume":"29","author":"Tansel","year":"1983","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(92)90086-K_BIB3","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1287\/mnsc.29.4.482","article-title":"Location on networks: a survey, part 1: The p-center and p-median problems","volume":"29","author":"Tansel","year":"1983","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(92)90086-K_BIB4","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1287\/trsc.17.2.218","article-title":"Optimal path of a single service unit on a network to a nonemergency destination","volume":"17","author":"Berman","year":"1983","journal-title":"Transptn Sci."},{"key":"10.1016\/0305-0548(92)90086-K_BIB5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1287\/trsc.21.2.115","article-title":"Optimal minimax path of a single service unit on a network to nonservice destinations","volume":"21","author":"Berman","year":"1987","journal-title":"Transptn Sci."},{"key":"10.1016\/0305-0548(92)90086-K_BIB6","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/opre.36.1.84","article-title":"Optimal obnoxious paths on a network: transportation of hazardous materials","volume":"36","author":"Batta","year":"1988","journal-title":"Ops Res"},{"key":"10.1016\/0305-0548(92)90086-K_BIB7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/opre.33.1.65","article-title":"A new polynomially bounded shortest path algorithm","volume":"33","author":"Glover","year":"1985","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(92)90086-K_BIB8","series-title":"Location on Networks: Theory and Algorithms","author":"Handler","year":"1979"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489290086K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489290086K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:22:42Z","timestamp":1552929762000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489290086K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["030505489290086K"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(92)90086-k","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}