{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:58Z","timestamp":1740122458601,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T00:00:00Z","timestamp":1507852800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"DFG","award":["PE 1434\/3-1","SFB 666"],"award-info":[{"award-number":["PE 1434\/3-1","SFB 666"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10878-017-0182-5","type":"journal-article","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T14:51:02Z","timestamp":1507906262000},"page":"861-870","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimization problems with color-induced budget constraints"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9869-6549","authenticated-orcid":false,"given":"Corinna","family":"Gottschalk","sequence":"first","affiliation":[]},{"given":"Hendrik","family":"L\u00fcthen","sequence":"additional","affiliation":[]},{"given":"Britta","family":"Peis","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Wierz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,13]]},"reference":[{"issue":"4","key":"182_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0305-0548(82)90026-0","volume":"9","author":"V Aggarwal","year":"1982","unstructured":"Aggarwal V, Aneja YP, Nair K (1982) Minimal spanning tree subject to a side constraint. Comput Oper Res 9(4):287\u2013296","journal-title":"Comput Oper Res"},{"key":"182_CR2","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1006\/aima.1993.1066","volume":"102","author":"M Barnabei","year":"1993","unstructured":"Barnabei M, Nicoletti G, Pezzoli L (1993) The symmetric exchange property for poset matroids. Adv Math 102:230\u2013239","journal-title":"Adv Math"},{"key":"182_CR3","unstructured":"Dunstan FDJ, Ingleton AW, Welsh DJA (1972) Supermatroids. In: Welsh DJA, Woodall DR (eds) Combinatorics (proceedings of the conference on combinatorial mathematics). pp. 72\u2013122. The Institute of Mathematics and its Applications"},{"key":"182_CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(79)90092-X","volume":"28","author":"U Faigle","year":"1979","unstructured":"Faigle U (1979) The greedy algorithm for partially ordered sets. Discrete Math 28:153\u2013159","journal-title":"Discrete Math"},{"key":"182_CR5","first-page":"115","volume":"19","author":"U Faigle","year":"1984","unstructured":"Faigle U (1984) Matroids on ordered sets and the greedy algorithm. Ann Discrete Math 19:115\u2013128","journal-title":"Ann Discrete Math"},{"issue":"4","key":"182_CR6","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1287\/opre.42.4.688","volume":"42","author":"U Faigle","year":"1994","unstructured":"Faigle U, Kern W (1994) Computational complexity of some maximum average weight problems with precedence constraints. Oper Res 42(4):688\u2013693. doi:\n                        10.1287\/opre.42.4.688","journal-title":"Oper Res"},{"key":"182_CR7","unstructured":"Fleiner T, Frank A, Iwata S (2003) A constrained independent set problem for matroids. Technical Report TR-2003-01, Egerv\u00e1ry Research Group, Budapest, \n                        www.cs.elte.hu\/egres"},{"key":"182_CR8","volume-title":"Submodular functions and optimization, Annals of Discrete Mathematics","author":"S Fujishige","year":"2005","unstructured":"Fujishige S (2005) Submodular functions and optimization, Annals of Discrete Mathematics, vol 58, 2nd edn. Elsevier, Amsterdam","edition":"2"},{"issue":"1","key":"182_CR9","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0196-6774(84)90042-7","volume":"5","author":"HN Gabow","year":"1984","unstructured":"Gabow HN, Tarjan RE (1984) Efficient algorithms for a family of matroid intersection problems. J Algorithms 5(1):80\u2013131","journal-title":"J Algorithms"},{"key":"182_CR10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0377-2217(91)90300-K","volume":"54","author":"H Groenevelt","year":"1991","unstructured":"Groenevelt H (1991) Two algorithms for maximizing a separable concave function over a polymatroid feasible region. J Oper Res 54:227\u2013236","journal-title":"J Oper Res"},{"issue":"1","key":"182_CR11","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/0211014","volume":"11","author":"PM Jensen","year":"1982","unstructured":"Jensen PM, Korte B (1982) Complexity of matroid property algorithms. SIAM J Comput 11(1):184\u2013190. doi:\n                        10.1137\/0211014","journal-title":"SIAM J Comput"},{"issue":"2","key":"182_CR12","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L Lov\u00e1sz","year":"1980","unstructured":"Lov\u00e1sz L (1980) Matroid matching and some applications. J Comb Theory Ser B 28(2):208\u2013236","journal-title":"J Comb Theory Ser B"},{"key":"182_CR13","unstructured":"L\u00fcthen H (2012) On matroids and shortest path with additional precedence constraints. Master\u2019s thesis, Technische Universit\u00e4t Berlin"},{"key":"182_CR14","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"E Martins","year":"1984","unstructured":"Martins E (1984) On a multicriteria shortest path problem. Eur J Oper Res 16:236\u2013245","journal-title":"Eur J Oper Res"},{"issue":"1","key":"182_CR15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K Mulmuley","year":"1987","unstructured":"Mulmuley K, Vazirani UV, Vazirani VV (1987) Matching is as easy as matrix inversion. Combinatorica 7(1):105\u2013113","journal-title":"Combinatorica"},{"key":"182_CR16","doi-asserted-by":"publisher","unstructured":"Murota K (2003) Discrete convex analysis. Society for Industrial and Applied Mathematics (SIAM). doi:\n                        10.1137\/1.9780898718508","DOI":"10.1137\/1.9780898718508"},{"key":"182_CR17","unstructured":"R\u00e4biger D (2005) Semi-Pr\u00e4emptives Transportieren [in German]. Ph.D. thesis, Universit\u00e4t zu K\u00f6ln"},{"key":"182_CR18","doi-asserted-by":"crossref","unstructured":"Valdes J, Tarjan RE, Lawler EL (1979) The recognition of series parallel digraphs. In: Proceedings of the eleventh annual ACM symposium on theory of computing. TOC \u201979, ACM, New York, NY, USA, pp 1\u201312","DOI":"10.1145\/800135.804393"},{"key":"182_CR19","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s00453-011-9519-0","volume":"63","author":"R Yuster","year":"2011","unstructured":"Yuster R (2011) Almost exact matchings. Algorithmica 63:39\u201350","journal-title":"Algorithmica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0182-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0182-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0182-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T12:59:11Z","timestamp":1535979551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0182-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,13]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["182"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0182-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,10,13]]}}}