{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:59Z","timestamp":1759063559698},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0167-6377(98)00028-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:07:44Z","timestamp":1027602464000},"page":"27-33","source":"Crossref","is-referenced-by-count":19,"title":["Lexicographic bottleneck combinatorial problems"],"prefix":"10.1016","volume":"23","author":[{"given":"P.T.","family":"Sokkalingam","sequence":"first","affiliation":[]},{"given":"Y.P.","family":"Aneja","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00028-5_BIB1","unstructured":"R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: theory, Algorithms and Applications, Prentice-Hall, Englewood Cliff, NY, 1993."},{"key":"10.1016\/S0167-6377(98)00028-5_BIB2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0167-6377(91)90018-K","article-title":"Lexicographic bottleneck problems","volume":"10","author":"Burkard","year":"1991","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0167-6377(98)00028-5_BIB3","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/363269.363610","article-title":"Algorithm 360: shortest path forest with topological ordering","volume":"12","author":"Dial","year":"1696","journal-title":"Comm. ACM"},{"key":"10.1016\/S0167-6377(98)00028-5_BIB4","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0022-0000(85)90039-X","article-title":"Scaling algorithms for network flows","volume":"31","author":"Gabow","year":"1985","journal-title":"J. of Comp. System Sci."},{"key":"10.1016\/S0167-6377(98)00028-5_BIB5","unstructured":"H.N. Gabow, Data structures for weighted matchings and nearest common ancestors with linking, Proc. 1st ACM\u2013SIAM Symp. on Discrete Algorithms, 1990, pp. 434\u2013443."},{"key":"10.1016\/S0167-6377(98)00028-5_BIB6","unstructured":"K.G. Murty, Linear Programming, Wiley, New York, 1983."},{"key":"10.1016\/S0167-6377(98)00028-5_BIB7","unstructured":"C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000285?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000285?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T21:28:26Z","timestamp":1556573306000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0167637798000285"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00028-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}