{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T06:46:58Z","timestamp":1749192418089},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,7,1]],"date-time":"1985-07-01T00:00:00Z","timestamp":489024000000},"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":10243,"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":[[1985,7]]},"DOI":"10.1016\/0166-218x(85)90073-3","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"209-222","source":"Crossref","is-referenced-by-count":33,"title":["A condition for the strong regularity of matrices in the minimax algebra"],"prefix":"10.1016","volume":"11","author":[{"given":"Peter","family":"Butkovi\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferdinand","family":"Hevery","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90073-3_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0120884","article-title":"Weakly admissible transformations for solving algebraic assignment and transportation problems","volume":"12","author":"Burkard","year":"1980","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(85)90073-3_BIB2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1093\/imamat\/7.3.273","article-title":"An algebra for network routing problems","volume":"7","author":"Carr\u00e9","year":"1971","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/0166-218X(85)90073-3_BIB3","series-title":"Minimax Algebra","author":"Cuninghame-Green","year":"1979"},{"key":"10.1016\/0166-218X(85)90073-3_BIB4","series-title":"Combinatorial Optimization - Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0166-218X(85)90073-3_BIB5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1051\/m2an\/196802R100711","article-title":"G\u00e9n\u00e9ralisation de l'algorithme de Warshall","volume":"2","author":"Robert","year":"1968","journal-title":"Rev. Francaise Informat. Recherche Op\u00e9rationelle"},{"key":"10.1016\/0166-218X(85)90073-3_BIB6","series-title":"Extrem\u00e1ln\u00ed Algebra","author":"Zimmermann","year":"1976"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900733?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900733?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T04:27:25Z","timestamp":1554784045000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900733"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,7]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,7]]}},"alternative-id":["0166218X85900733"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90073-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,7]]}}}