乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T07:13:15Z","timestamp":1716621195669},"reference-count":23,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100008314","name":"Athens University of Economics and Business","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008314","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1016\/j.disc.2019.111804","type":"journal-article","created":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T18:17:17Z","timestamp":1579025837000},"page":"111804","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["The diameter of the stable marriage polytope: Bounding from below"],"prefix":"10.1016","volume":"343","author":[{"given":"Pavlos","family":"Eirinakis","sequence":"first","affiliation":[]},{"given":"Dimitrios","family":"Magos","sequence":"additional","affiliation":[]},{"given":"Ioannis","family":"Mourtos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.disc.2019.111804_b1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(99)00203-6","article-title":"Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)","volume":"101","author":"Ba\u00efou","year":"2000","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.disc.2019.111804_b2","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/moor.27.4.662.302","article-title":"The stable allocation (or ordinal transportation) problem","volume":"27","author":"Ba\u00efou","year":"2002","journal-title":"Math. Oper. Res."},{"issue":"4","key":"10.1016\/j.disc.2019.111804_b3","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/S0036144595294515","article-title":"Of stable marriages and graphs, and strategy and polytopes","volume":"39","author":"Balinski","year":"1997","journal-title":"SIAM Rev."},{"issue":"3","key":"10.1016\/j.disc.2019.111804_b4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0097-3165(84)90056-6","article-title":"Every finite distributive lattice is a set of stable matchings","volume":"37","author":"Blair","year":"1984","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"10.1016\/j.disc.2019.111804_b5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s00493-006-0010-5","article-title":"A linear bound on the diameter of the transportation polytope","volume":"26","author":"Brightwell","year":"2006","journal-title":"Combinatorica"},{"issue":"8","key":"10.1016\/j.disc.2019.111804_b6","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1016\/j.jcta.2009.03.010","article-title":"Graphs of transportation polytopes","volume":"116","author":"De\u00a0Loera","year":"2009","journal-title":"J. Combin. Theory Ser. A"},{"issue":"4","key":"10.1016\/j.disc.2019.111804_b7","doi-asserted-by":"crossref","first-page":"1971","DOI":"10.1137\/140979150","article-title":"From one stable marriage to the next; How long is the way?","volume":"28","author":"Eirinakis","year":"2014","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.disc.2019.111804_b8","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1287\/moor.2013.0616","article-title":"Polyhedral aspects of stable marriage","volume":"39","author":"Eirinakis","year":"2014","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10.1016\/j.disc.2019.111804_b9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.28.1.103.14256","article-title":"A fixed-point approach to the stable matchings and some applications","volume":"28","author":"Fleiner","year":"2003","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.disc.2019.111804_b10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/j.disc.2019.111804_b11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0216010","article-title":"Three fast algorithms for four problems in stable marriage","volume":"16","author":"Gusfield","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.disc.2019.111804_b12","series-title":"The Stable Marriage Problem: Structure and Algorithms","author":"Gusfield","year":"1989"},{"key":"10.1016\/j.disc.2019.111804_b13","series-title":"Proceedings 7th Hungarian Colloquium on Combinatorics","first-page":"301","article-title":"On the diameter of the b-matching polytope","volume":"vol. 52","author":"Hurkens","year":"1988"},{"key":"10.1016\/j.disc.2019.111804_b14","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1137\/0215048","article-title":"The complexity of counting stable marriages","volume":"15","author":"Irving","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.disc.2019.111804_b15","series-title":"Marriage Stables","author":"Knuth","year":"1976"},{"key":"10.1016\/j.disc.2019.111804_b16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(92)90028-V","article-title":"Kernels in perfect line-graphs","volume":"55","author":"Maffray","year":"1992","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disc.2019.111804_b17","series-title":"Algorithmics of Matching under Preferences","author":"Manlove","year":"2013"},{"key":"10.1016\/j.disc.2019.111804_b18","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BF01585502","article-title":"The travelling salesman problem and a class of polyhedra with diameter two","volume":"7","author":"Padberg","year":"1974","journal-title":"Math. Program."},{"key":"10.1016\/j.disc.2019.111804_b19","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0012-365X(94)00237-D","article-title":"On the stable marriage polytope","volume":"148","author":"Ratier","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2019.111804_b20","doi-asserted-by":"crossref","unstructured":"Laura Sanit\u00e0, The diameter of the fractional matching polytope and its hardness implications, in: FOCS, 2018, pp. 910\u2013921.","DOI":"10.1109\/FOCS.2018.00090"},{"key":"10.1016\/j.disc.2019.111804_b21","series-title":"Combinatorial Optimization: Polyhedral and Efficiency","author":"Schrijver","year":"2003"},{"key":"10.1016\/j.disc.2019.111804_b22","series-title":"Graph-Theoretic Concepts in Computer Science (Kerkrade, 1989)","first-page":"244","article-title":"Finding a minimal transitive reduction in a strongly connected digraph within linear time","author":"Simon","year":"1990"},{"key":"10.1016\/j.disc.2019.111804_b23","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0167-6377(89)90041-2","article-title":"Linear programming brings marital bliss","volume":"8","author":"Vande\u00a0Vate","year":"1989","journal-title":"Oper. Res. Lett."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X19304868?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X19304868?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T08:40:27Z","timestamp":1714552827000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X19304868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["S0012365X19304868"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2019.111804","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2020,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The diameter of the stable marriage polytope: Bounding from below","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2019.111804","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"111804"}}