{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T00:26:45Z","timestamp":1652488005310},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,7,1]],"date-time":"1986-07-01T00:00:00Z","timestamp":520560000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1986,7]]},"DOI":"10.1007\/bf01580885","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:56:59Z","timestamp":1114678619000},"page":"362-364","source":"Crossref","is-referenced-by-count":7,"title":["On the average length of lexicographic paths"],"prefix":"10.1007","volume":"35","author":[{"given":"M. L.","family":"Balinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Th. M.","family":"Liebling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. -E.","family":"Nobs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Th.M. Liebling, \u201cOn cases where the number of steps of the simplex method is a poisson variable\u201d, TR 09, IFOR ETH-Z\u00fcrich (1975)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02591931","volume":"30","author":"P.O. Lindberg","year":"1984","unstructured":"P.O. Lindberg and S. \u00d3lafsson, \u201cOn the length of simplex paths: The assignment case\u201c,Mathematical Programming 30 (1984) 243\u2013260.","journal-title":"Mathematical Programming"},{"key":"CR3","unstructured":"N. Megiddo, \u201cA note on degeneracy in linear programming\u201d, Research Report RJ-4895, The IBM Almaden Research Center, San Jose, CA."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580885.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580885\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:12Z","timestamp":1556896332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,7]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,7]]}},"alternative-id":["BF01580885"],"URL":"https:\/\/doi.org\/10.1007\/bf01580885","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,7]]}}}