{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T02:48:52Z","timestamp":1692413332051},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"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":[[1999,5]]},"DOI":"10.1016\/s0167-6377(99)00013-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:14:29Z","timestamp":1027624469000},"page":"187-194","source":"Crossref","is-referenced-by-count":22,"title":["An improved general procedure for lexicographic bottleneck problems"],"prefix":"10.1016","volume":"24","author":[{"given":"Federico Della","family":"Croce","sequence":"first","affiliation":[]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[]},{"given":"Alexis","family":"Tsoukias","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(99)00013-9_BIB1","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/BF01593800","article-title":"An algebraic approach to assignment problems","volume":"12","author":"Burkard","year":"1977","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(99)00013-9_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":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(99)00013-9_BIB3","unstructured":"R.E. Burkard, U. Zimmermann, Combinatorial optimization in linearly ordered semimodules: a survey, in: B. Korte (Ed.), Modern Applied Mathematics: Optimization and Operations Research, North-Holland, Amsterdam, 1982."},{"key":"10.1016\/S0167-6377(99)00013-9_BIB4","doi-asserted-by":"crossref","unstructured":"H.I. Calvete, P.M. Mateo, Lexicographic optimization in generalized network flow problems, J. Oper. Res. Soc. 49(5) (1998) 519\u2013529.","DOI":"10.1057\/palgrave.jors.2600529"},{"key":"10.1016\/S0167-6377(99)00013-9_BIB5","unstructured":"N. Christophides, Graph Theory an Algorithmic Approach, Academic Press, New York, 1975."},{"key":"10.1016\/S0167-6377(99)00013-9_BIB6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/S0167-6377(99)00013-9_BIB7","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.1287\/mnsc.20.11.1442","article-title":"Lexicographic orders, utilities and decision rules: a survey","volume":"20","author":"Fishburn","year":"1974","journal-title":"Manage. Sci."},{"key":"10.1016\/S0167-6377(99)00013-9_BIB8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Nav. Res. Logist. Quart."},{"key":"10.1016\/S0167-6377(99)00013-9_BIB9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0166-218X(94)90039-6","article-title":"Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem","volume":"55","author":"Punnen","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(99)00013-9_BIB10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.2307\/2964389","article-title":"Foundational aspects of theories of measurement","volume":"23","author":"Scott","year":"1958","journal-title":"J. Symbol. Logic"},{"key":"10.1016\/S0167-6377(99)00013-9_BIB11","unstructured":"Ph. Vincke, Multicriteria Decision Aid, Wiley, New York, 1992."},{"key":"10.1016\/S0167-6377(99)00013-9_BIB12","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0167-5060(08)70759-3","article-title":"Some partial orders related to Boolean optimization and the greedy algorithm","volume":"1","author":"Zimmermann","year":"1977","journal-title":"Ann. Discrete Math."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000139?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000139?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:54:59Z","timestamp":1555563299000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637799000139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0167637799000139"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(99)00013-9","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}