{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:08:04Z","timestamp":1767035284562,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T00:00:00Z","timestamp":1562112000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T00:00:00Z","timestamp":1562112000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11201439","11871442"],"award-info":[{"award-number":["11201439","11871442"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10898-019-00800-2","type":"journal-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:02:53Z","timestamp":1562158973000},"page":"833-849","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Parametric monotone function maximization with matroid constraints"],"prefix":"10.1007","volume":"75","author":[{"given":"Suning","family":"Gong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0895-7793","authenticated-orcid":false,"given":"Qingqin","family":"Nong","sequence":"additional","affiliation":[]},{"given":"Wenjing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,3]]},"reference":[{"issue":"3","key":"800_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/B:JOCO.0000038913.96607.c2","volume":"8","author":"AA Ageev","year":"2004","unstructured":"Ageev, A.A., Sviridenko, M.I.: Pipage rounding: a new method of constructing algorithms with proven performance guarantee. J. Comb. Optim. 8(3), 307\u2013328 (2004)","journal-title":"J. Comb. Optim."},{"key":"800_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N Alon","year":"2008","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, vol. 3, pp. 307\u2013314. Wiley, New York (2008)"},{"key":"800_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Gamzu, I., Tennenholtz, M.: Optimizing budget allocation among channels and influencers. In: Proceedings of the 21st international conference on World Wide Web, ACM, 381\u2013388 (2012)","DOI":"10.1145\/2187836.2187888"},{"key":"800_CR4","unstructured":"Bian, A.A., Buhmann, J.M., Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications. In: International conference on machine learning, 498\u2013507 (2017)"},{"issue":"3","key":"800_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti, M., Cornu\u00e9jols, G.: Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete Appl. Math. 7(3), 251\u2013274 (1984)","journal-title":"Discrete Appl. Math."},{"key":"800_CR6","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a submodular set function subject to a matroid constraint. In: 12th international IPCO conference on integer programming and combinatorial optimization, 182\u2013196 (2007)","DOI":"10.1007\/978-3-540-72792-7_15"},{"key":"800_CR7","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. In: Proceedings of the forty-third annual ACM symposium on theory of computing, ACM, 783\u2013792 (2011)","DOI":"10.1145\/1993636.1993740"},{"key":"800_CR8","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. In: Proceedings of the 28th international conference on international conference on machine learning, Omnipress, 1057\u20131064 (2011)"},{"issue":"1","key":"800_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Progr. 1(1), 127\u2013136 (1971)","journal-title":"Math. Progr."},{"key":"800_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-36478-1_2","volume-title":"Submodular Functions, Matroids, and Certain Polyhedra. Combinatorial OptimizationEureka, You Shrink!","author":"J Edmonds","year":"2003","unstructured":"Edmonds, J.: Submodular Functions, Matroids, and Certain Polyhedra. Combinatorial OptimizationEureka, You Shrink!, pp. 11\u201326. Springer, Berlin (2003)"},{"key":"800_CR11","doi-asserted-by":"crossref","unstructured":"Feige, U., Izsak, R.: Welfare maximization and the supermodular degree. In: Proceedings of the 4th conference on innovations in theoretical computer science, ACM, 247\u2013256 (2013)","DOI":"10.1145\/2422436.2422466"},{"key":"800_CR12","unstructured":"Feldman, M., Izsak, R.: Constrained monotone function maximization and the supermodular degree. arXiv preprint arXiv:1407.6328 (2014)"},{"issue":"2","key":"800_CR13","doi-asserted-by":"publisher","first-page":"89C103","DOI":"10.1007\/BF01651330","volume":"22","author":"CM Fortuin","year":"1971","unstructured":"Fortuin, C.M., Kasteleyn, P.W., Ginibre, J.: Correlation inequalities on some partially ordered sets. Commun. Math. Phys. 22(2), 89C103 (1971)","journal-title":"Commun. Math. Phys."},{"key":"800_CR14","first-page":"73","volume-title":"An Analysis of Approximations for Maximizing Submodular Set FunctionsII. Polyhedral Combinatorics","author":"ML Fisher","year":"1978","unstructured":"Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An Analysis of Approximations for Maximizing Submodular Set FunctionsII. Polyhedral Combinatorics, pp. 73\u201387. Springer, Berlin (1978)"},{"key":"800_CR15","volume-title":"Submodular Functions and Optimization","author":"S Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization, vol. 58. Elsevier, Amsterdam (2005)"},{"key":"800_CR16","unstructured":"Iyer, R., Bilmes, J.: Algorithms for approximate minimization of the difference between submodular functions, with applications. arXiv preprint arXiv:1207.0560 (2012)"},{"key":"800_CR17","unstructured":"Kuhnle, A., Smith, J.D., Crawford, V.G., Thai, M.T.: Fast maximization of non-submodular, monotonic functions on the integer lattice. arXiv preprint arXiv:1805.06990 (2018)"},{"issue":"2","key":"800_CR18","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55(2), 270\u2013296 (2006)","journal-title":"Games Econ. Behav."},{"issue":"1\u20132","key":"800_CR19","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10107-014-0792-y","volume":"152","author":"T Maehara","year":"2015","unstructured":"Maehara, T., Murota, K.: A framework of discrete DC programming by discrete convex analysis. Math. Progr. 152(1\u20132), 435\u2013466 (2015)","journal-title":"Math. Progr."},{"key":"800_CR20","unstructured":"Narasimhan, M., Bilmes, J.A.: A submodular-supermodular procedure with applications to discriminative structure learning. arXiv preprint arXiv:1207.1404 (2012)"},{"issue":"1","key":"800_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functionsI. Math. Progr. 14(1), 265\u2013294 (1978)","journal-title":"Math. Progr."},{"key":"800_CR22","first-page":"847","volume":"1","author":"T Soma","year":"2015","unstructured":"Soma, T., Yoshida, Y.: A generalization of submodular cover via the diminishing return property on the integer lattice. Adv. Neural Inf. Process. Syst. 1, 847\u2013855 (2015)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1\u20132","key":"800_CR23","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10107-018-1324-y","volume":"172","author":"T Soma","year":"2018","unstructured":"Soma, T., Yoshida, Y.: Maximizing monotone submodular functions over the integer lattice. Math. Progr. 172(1\u20132), 539\u2013563 (2018)","journal-title":"Math. Progr."},{"key":"800_CR24","doi-asserted-by":"crossref","unstructured":"Soma, T., Yoshida, Y.: Non-monotone dr-submodular function maximization. In: Thirty-First AAAI conference on artificial intelligence, 898\u2013904 (2017)","DOI":"10.1609\/aaai.v31i1.10653"},{"key":"800_CR25","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of the fortieth annual ACM symposium on theory of computing, ACM, 67\u201374 (2008)","DOI":"10.1145\/1374376.1374389"},{"key":"800_CR26","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"J Vondr\u00e1k","year":"1982","unstructured":"Vondr\u00e1k, J.: Submodularity and curvature: the optimal algorithm. Combinatorica 2, 385\u2013393 (1982)","journal-title":"Combinatorica"},{"issue":"1","key":"800_CR27","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10107-018-1242-z","volume":"169","author":"C Wu","year":"2018","unstructured":"Wu, C., Wang, Y., Lu, Z., Pardalos, P.M., Xu, D., Zhang, Z., Du, D.Z.: Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming. Math. Progr. 169(1), 255\u2013275 (2018)","journal-title":"Math. Progr."},{"key":"800_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-018-0233-3","author":"WL Wu","year":"2018","unstructured":"Wu, W.L., Zhang, Z., Du, D.Z.: Set function optimization. J. Oper. Res. Soc. China (2018). https:\/\/doi.org\/10.1007\/s40305-018-0233-3","journal-title":"J. Oper. Res. Soc. China"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00800-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00800-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00800-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T21:14:42Z","timestamp":1663881282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00800-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,3]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["800"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00800-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2019,7,3]]},"assertion":[{"value":"25 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}