{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T18:54:48Z","timestamp":1773168888605,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,5,1]],"date-time":"1984-05-01T00:00:00Z","timestamp":452217600000},"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":10669,"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":[[1984,5]]},"DOI":"10.1016\/0166-218x(84)90100-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"189-194","source":"Crossref","is-referenced-by-count":12,"title":["An algorithm to determine a path with minimal cost\/capacity ratio"],"prefix":"10.1016","volume":"8","author":[{"given":"Ernesto Queir\u00f3s Vieira","family":"Martins","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(84)90100-8_BIB1","series-title":"Semin\u00e1rio Avan\u00e7ado Sobre Optimiza\u00e7\u00e3o","article-title":"Sobre a determina\u00e7\u00e3o de um caminho entre dois dados v\u00e9rtices de uma rede, que minimiza o quociente de duas fun\u00e7\u00f5es lineares","author":"Cl\u00edmaco","year":"1982"},{"key":"10.1016\/0166-218X(84)90100-8_BIB2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0377-2217(82)90205-3","article-title":"A bicriterion shortest path algorithm","volume":"11","author":"Cl\u00edmaco","year":"1982","journal-title":"Europ. J. Oper. Res."},{"key":"10.1016\/0166-218X(84)90100-8_BIB3","series-title":"Multiple Criteria Decision Making: Theory and Applications","first-page":"109","article-title":"Bicriterion path problems","volume":"177","author":"Hansen","year":"1980"},{"key":"10.1016\/0166-218X(84)90100-8_BIB4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0167-5060(08)70830-6","article-title":"Shortest path and network flow algorithms","volume":"4","author":"Lawler","year":"1979","journal-title":"Annals Discrete Math."},{"key":"10.1016\/0166-218X(84)90100-8_BIB5","doi-asserted-by":"crossref","unstructured":"E.Q.V. Martins, On a special class of bicriterion path problems, Europ. J. Oper. Res., to appear.","DOI":"10.1016\/0377-2217(84)90011-0"},{"key":"10.1016\/0166-218X(84)90100-8_BIB6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/nav.3800110204","article-title":"Hyperbolic programming","volume":"11","author":"Martos","year":"1964","journal-title":"Naval Res. Logist. Quart."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84901008?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84901008?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:52:20Z","timestamp":1555120340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X84901008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,5]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,5]]}},"alternative-id":["0166218X84901008"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(84)90100-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1984,5]]}}}