{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T05:27:06Z","timestamp":1773898026370,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science","doi-asserted-by":"publisher","award":["W1230"],"award-info":[{"award-number":["W1230"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,7]]},"abstract":"Abstract<\/jats:title>Given two matroids $$\\mathcal {M}_{1} = (E, \\mathcal {B}_{1})$$<\/jats:tex-math>\n \n \n M<\/mml:mi>\n 1<\/mml:mn>\n <\/mml:msub>\n =<\/mml:mo>\n \n (<\/mml:mo>\n E<\/mml:mi>\n ,<\/mml:mo>\n \n B<\/mml:mi>\n 1<\/mml:mn>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and $$\\mathcal {M}_{2} = (E, \\mathcal {B}_{2})$$<\/jats:tex-math>\n \n \n M<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n =<\/mml:mo>\n \n (<\/mml:mo>\n E<\/mml:mi>\n ,<\/mml:mo>\n \n B<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> on a common ground set E<\/jats:italic> with base sets $$\\mathcal {B}_1$$<\/jats:tex-math>\n \n B<\/mml:mi>\n 1<\/mml:mn>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and $$\\mathcal {B}_2$$<\/jats:tex-math>\n \n B<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, some integer $$k \\in \\mathbb {N}$$<\/jats:tex-math>\n \n k<\/mml:mi>\n \u2208<\/mml:mo>\n N<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and two cost functions $$c_{1}, c_{2} :E \\rightarrow \\mathbb {R}$$<\/jats:tex-math>\n \n \n c<\/mml:mi>\n 1<\/mml:mn>\n <\/mml:msub>\n ,<\/mml:mo>\n \n c<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n :<\/mml:mo>\n E<\/mml:mi>\n \u2192<\/mml:mo>\n R<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, we consider the optimization problem to find a basis $$X \\in \\mathcal {B}_{1}$$<\/jats:tex-math>\n \n X<\/mml:mi>\n \u2208<\/mml:mo>\n \n B<\/mml:mi>\n 1<\/mml:mn>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and a basis $$Y \\in \\mathcal {B}_{2}$$<\/jats:tex-math>\n \n Y<\/mml:mi>\n \u2208<\/mml:mo>\n \n B<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> minimizing the cost $$\\sum _{e\\in X} c_1(e)+\\sum _{e\\in Y} c_2(e)$$<\/jats:tex-math>\n \n \n \u2211<\/mml:mo>\n \n e<\/mml:mi>\n \u2208<\/mml:mo>\n X<\/mml:mi>\n <\/mml:mrow>\n <\/mml:msub>\n \n c<\/mml:mi>\n 1<\/mml:mn>\n <\/mml:msub>\n \n (<\/mml:mo>\n e<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n +<\/mml:mo>\n \n \u2211<\/mml:mo>\n \n e<\/mml:mi>\n \u2208<\/mml:mo>\n Y<\/mml:mi>\n <\/mml:mrow>\n <\/mml:msub>\n \n c<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n \n (<\/mml:mo>\n e<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> subject to either a lower bound constraint $$|X \\cap Y| \\le k$$<\/jats:tex-math>\n \n |<\/mml:mo>\n X<\/mml:mi>\n \u2229<\/mml:mo>\n Y<\/mml:mi>\n |<\/mml:mo>\n \u2264<\/mml:mo>\n k<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, an upper bound constraint $$|X \\cap Y| \\ge k$$<\/jats:tex-math>\n \n |<\/mml:mo>\n X<\/mml:mi>\n \u2229<\/mml:mo>\n Y<\/mml:mi>\n |<\/mml:mo>\n \u2265<\/mml:mo>\n k<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, or an equality constraint $$|X \\cap Y| = k$$<\/jats:tex-math>\n \n |<\/mml:mo>\n X<\/mml:mi>\n \u2229<\/mml:mo>\n Y<\/mml:mi>\n |<\/mml:mo>\n =<\/mml:mo>\n k<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> on the size of the intersection of the two bases X<\/jats:italic> and Y<\/jats:italic>. The problem with lower bound constraint turns out to be a generalization of the Recoverable Robust Matroid problem under interval uncertainty representation for which the question for a strongly polynomial-time algorithm was left as an open question in Hradovich et al. (J Comb Optim 34(2):554\u2013573, 2017). We show that the two problems with lower and upper bound constraints on the size of the intersection can be reduced to weighted matroid intersection, and thus be solved with a strongly polynomial-time primal-dual algorithm. We also present a strongly polynomial, primal-dual algorithm that computes a minimum cost solution for every feasible size of the intersection k<\/jats:italic> in one run with asymptotic running time equal to one run of Frank\u2019s matroid intersection algorithm. Additionally, we discuss generalizations of the problems from matroids to polymatroids, and from two to three or more matroids. We obtain a strongly polynomial time algorithm for the recoverable robust polymatroid base problem with interval uncertainties.\n<\/jats:p>","DOI":"10.1007\/s10107-021-01642-1","type":"journal-article","created":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T14:03:14Z","timestamp":1617026594000},"page":"661-684","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Matroid bases with cardinality constraints on the intersection"],"prefix":"10.1007","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5660-5397","authenticated-orcid":false,"given":"Stefan","family":"Lendl","sequence":"first","affiliation":[]},{"given":"Britta","family":"Peis","sequence":"additional","affiliation":[]},{"given":"Veerle","family":"Timmermans","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,29]]},"reference":[{"key":"1642_CR1","volume-title":"Recoverable Robustness in Combinatorial Optimization","author":"C B\u00fcsing","year":"2011","unstructured":"B\u00fcsing, C.: Recoverable Robustness in Combinatorial Optimization. Cuvillier Verlag, New York (2011)"},{"key":"1642_CR2","first-page":"76109","volume":"3","author":"A Chassein","year":"2020","unstructured":"Chassein, A., Goerigk, M.: On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. Discrete Appl. Math. 3, 76109 (2020)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"1642_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01215915","volume":"17","author":"WH Cunningham","year":"1997","unstructured":"Cunningham, W.H., Geelen, J.F.: The optimal path-matching problem. Combinatorica 17(3), 315\u2013337 (1997)","journal-title":"Combinatorica"},{"key":"1642_CR4","unstructured":"Edmonds, J.: Submodular functions, matroids and certain polyhedra, combinatorial structures and their applications (R. Guy, H. Hanani, N. Sauer and J. Sch\u00f6nheim, eds.). Gordon and Breach pp. 69\u201387 (1970)"},{"issue":"4","key":"1642_CR5","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","volume":"2","author":"A Frank","year":"1981","unstructured":"Frank, A.: A weighted matroid intersection algorithm. J. Algorithms 2(4), 328\u2013336 (1981)","journal-title":"J. Algorithms"},{"key":"1642_CR6","volume-title":"Submodular Functions and Optimization","author":"S Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization, vol. 58. Elsevier, Oxford (2005)"},{"key":"1642_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0066195","volume-title":"Hypergraph Seminar","author":"T Helgason","year":"1974","unstructured":"Helgason, T.: Aspects of the theory of hypermatroids. In: Berge, C., Ray-Chaudhuri, D. (eds.) Hypergraph Seminar, pp. 191\u2013213. Springer, Berlin (1974)"},{"issue":"2","key":"1642_CR8","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/s10878-016-0089-6","volume":"34","author":"M Hradovich","year":"2017","unstructured":"Hradovich, M., Kasperski, A., Zieli\u0144ski, P.: Recoverable robust spanning tree problem under interval uncertainty representations. J. Comb. Optim. 34(2), 554\u2013573 (2017)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"1642_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s11590-016-1057-x","volume":"11","author":"M Hradovich","year":"2017","unstructured":"Hradovich, M., Kasperski, A., Zieli\u0144ski, P.: The recoverable robust spanning tree problem with interval costs is polynomially solvable. Optim. Lett. 11(1), 17\u201330 (2017)","journal-title":"Optim. Lett."},{"issue":"1","key":"1642_CR10","first-page":"32","volume":"19","author":"M Iri","year":"1976","unstructured":"Iri, M., Tomizawa, N.: An algorithm for finding an optimal independent assignment. J. Oper. Res. Soc. Japan 19(1), 32\u201357 (1976)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"1642_CR11","doi-asserted-by":"crossref","unstructured":"Iwamasa, Y., Takazawa, K.: Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications. arXiv preprint arXiv:2003.02424 (2020)","DOI":"10.1007\/s10107-021-01625-2"},{"key":"1642_CR12","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2007","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer Publishing Company, Incorporated (2007)","edition":"4"},{"key":"1642_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.disopt.2019.03.004","volume":"33","author":"S Lendl","year":"2019","unstructured":"Lendl, S., \u0106usti\u0107, A., Punnen, A.P.: Combinatorial optimization with interaction costs: complexity and solvable cases. Discrete Optim. 33, 101\u2013117 (2019)","journal-title":"Discrete Optim."},{"key":"1642_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-030-17953-3_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Linhares","year":"2019","unstructured":"Linhares, A., Olver, N., Swamy, C., Zenklusen, R.: Approximate multi-matroid intersection via iterative refinement. In: Lodi, A., Nagarajan, V. (eds.) Integer Programming and Combinatorial Optimization, pp. 299\u2013312. Springer International Publishing, Cham (2019)"},{"issue":"4","key":"1642_CR15","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/S0895480195279994","volume":"9","author":"K Murota","year":"1996","unstructured":"Murota, K.: Valuated matroid intersection i: optimality criteria. SIAM J. Discrete Math. 9(4), 545\u2013561 (1996)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"1642_CR16","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1137\/S0895480195280009","volume":"9","author":"K Murota","year":"1996","unstructured":"Murota, K.: Valuated matroid intersection ii: algorithms. SIAM J. Discrete Math. 9(4), 562\u2013576 (1996)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20133","key":"1642_CR17","first-page":"313","volume":"83","author":"K Murota","year":"1998","unstructured":"Murota, K.: Discrete convex analysis. Math. Program. 83(1\u20133), 313\u2013371 (1998)","journal-title":"Math. Program."},{"key":"1642_CR18","volume-title":"Matroid Theory","author":"JG Oxley","year":"2006","unstructured":"Oxley, J.G.: Matroid Theory, vol. 3. Oxford University Press, Oxford (2006)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01642-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01642-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01642-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T19:13:03Z","timestamp":1656357183000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01642-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,29]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1642"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01642-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,29]]},"assertion":[{"value":"26 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}