{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:13:35Z","timestamp":1649027615123},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1007\/bf01415971","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T08:10:23Z","timestamp":1112515823000},"page":"79-89","source":"Crossref","is-referenced-by-count":0,"title":["k-Best constrained bases of a matroid"],"prefix":"10.1007","volume":"34","author":[{"given":"M.","family":"Leclerc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Rendl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(87)90017-5","volume":"18","author":"CR Chegireddy","year":"1987","unstructured":"Chegireddy CR, Hamacher HW (1987) Algorithms for finding k-best perfect matchings. Discrete Applied Mathematics 18:155?165","journal-title":"Discrete Applied Mathematics"},{"key":"CR2","unstructured":"Camerini PM, Hamacher HW (1986) Intersections of two matroids: (condensed) Border graphs and ranking. Research Report 86-11, University of Gainesville"},{"key":"CR3","unstructured":"Derigs U (1983) Some basic exchange properties in combinatorial optimization and their application to constructing thek best solutions. Report 83295, Universit\u00e4t Bonn"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02022039","volume":"4","author":"HW Hamacher","year":"1985","unstructured":"Hamacher HW, Queyranne M (1985)k best solutions to combinatorial optimization problems. Annals of Oper Res 4:123?143","journal-title":"Annals of Oper Res"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"EL Lawler","year":"1972","unstructured":"Lawler EL (1972) A procedure for computing theK best solutions to discrete optimization problems and its application to the shortest path problem. Management Science 18:401?405","journal-title":"Management Science"},{"key":"CR6","volume-title":"Combinatorial optimization: networks and matroids","author":"EL Lawler","year":"1976","unstructured":"Lawler EL (1976) Combinatorial optimization: networks and matroids. Holt Rinehart and Winston, New York"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1287\/opre.16.3.682","volume":"16","author":"KG Murty","year":"1968","unstructured":"Murty KG (1968) An algorithm for ranking all the assignments in order of increasing cost. Oper Res 16:682?687","journal-title":"Oper Res"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0377-2217(85)90009-8","volume":"20","author":"F Rendl","year":"1985","unstructured":"Rendl F (1985) Ranking scalar products to improve bounds for the quadratic assignment problem. European J Oper Res 20:363?372","journal-title":"European J Oper Res"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0012-365X(88)90149-5","volume":"73","author":"F Rendl","year":"1988\/89","unstructured":"Rendl F, Leclerc M (1988\/89) A multiply constrained matroid optimization problem. Discrete Mathematics 73:207?212","journal-title":"Discrete Mathematics"}],"container-title":["ZOR Zeitschrift f\ufffdr Operations Research Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01415971.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01415971\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01415971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:12:38Z","timestamp":1556817158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01415971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["BF01415971"],"URL":"https:\/\/doi.org\/10.1007\/bf01415971","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}