{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:34:29Z","timestamp":1742913269469,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_21","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"291-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal General Factor Problem and\u00a0Jump System Intersection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9478-7307","authenticated-orcid":false,"given":"Yusuke","family":"Kobayashi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1137\/090752699","volume":"40","author":"E Anshelevich","year":"2011","unstructured":"Anshelevich, E., Karagiozova, A.: Terminal backup, 3D matching, and covering cubic graphs. SIAM J. Comput. 40, 678\u2013708 (2011)","journal-title":"SIAM J. Comput."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1137\/S0895480191222926","volume":"8","author":"A Bouchet","year":"1995","unstructured":"Bouchet, A., Cunningham, W.H.: Delta-matroids, jump systems, and bisubmodular polyhedra. SIAM J. Discret. Math. 8, 17\u201332 (1995)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0095-8956(88)90068-8","volume":"45","author":"G Cornu\u00e9jols","year":"1988","unstructured":"Cornu\u00e9jols, G.: General factors of graphs. J. Comb. Theory Ser. B 45(2), 185\u2013198 (1988)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0167-6377(82)90016-5","volume":"1","author":"G Cornu\u00e9jols","year":"1982","unstructured":"Cornu\u00e9jols, G., Hartvigsen, D., Pulleyblank, W.: Packing subgraphs in a graph. Oper. Res. Lett. 1(4), 139\u2013143 (1982)","journal-title":"Oper. Res. Lett."},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Dudycz, S., Paluch, K.E.: Optimal general matchings. In: WG 2018. LNCS, vol. 11159, pp. 176\u2013189. Springer, Cham (2018). arXiv version is available at http:\/\/arxiv.org\/abs\/1706.07418. https:\/\/doi.org\/10.1007\/978-3-030-00256-5_15","DOI":"10.1007\/978-3-030-00256-5_15"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"21_CR7","unstructured":"Fujishige, S.: Submodular Functions and Optimization, 2nd edn, vol. 58. Annals of Discrete Mathematics. Elsevier, Amsterdam (2005)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/0211014","volume":"11","author":"PM Jensen","year":"1982","unstructured":"Jensen, P.M., Korte, B.: Complexity of matroid property algorithms. SIAM J. Comput. 11, 184\u2013190 (1982)","journal-title":"SIAM J. Comput."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Kabadi, S.N., Sridhar, R.: $$\\varDelta $$-matroid and jump system. J. Appl. Math. Decis. Sci. 2005(2), 95\u2013106 (2005)","DOI":"10.1155\/JAMDS.2005.95"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Kobayashi, Y.: Optimal general factor problem and jump system intersection. arXiv:2209.00779 (2022)","DOI":"10.1007\/978-3-031-32726-1_21"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1137\/060652841","volume":"21","author":"Y Kobayashi","year":"2007","unstructured":"Kobayashi, Y., Murota, K., Tanaka, K.: Operations on M-convex functions on jump systems. SIAM J. Discret. Math. 21, 107\u2013129 (2007)","journal-title":"SIAM J. Discret. Math."},{"key":"21_CR12","volume-title":"Combinatorial Optimization \u2013 Networks and Matroids","author":"EL Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization \u2013 Networks and Matroids. Holt, Rinehalt, and Winston, New York (1976)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01889919","volume":"23","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: The factorization of graphs. II. Acta Mathematica Academiae Scientiarum Hungarica 23, 223\u2013246 (1972)","journal-title":"Acta Mathematica Academiae Scientiarum Hungarica"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02276100","volume":"4","author":"L Lov\u00e1sz","year":"1973","unstructured":"Lov\u00e1sz, L.: Antifactors of graphs. Period. Math. Hung. 4, 121\u2013123 (1973)","journal-title":"Period. Math. Hung."},{"key":"21_CR15","unstructured":"Lov\u00e1sz, L.: The matroid matching problem. Algebr. Methods Graph Theory Colloq. Math. Soc. J\u00e1nos Bolyai 25, 495\u2013517 (1978)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L Lov\u00e1sz","year":"1980","unstructured":"Lov\u00e1sz, L.: Matroid matching and some applications. J. Comb. Theory Ser. B 28, 208\u2013236 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1006\/jctb.1997.1744","volume":"70","author":"L Lov\u00e1sz","year":"1997","unstructured":"Lov\u00e1sz, L.: The membership problem in jump systems. J. Comb. Theory Ser. B 70, 45\u201366 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"key":"21_CR18","volume-title":"Matching Theory","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. North-Holland, Amsterdam (1986)"},{"issue":"2","key":"21_CR19","first-page":"45","volume":"64","author":"N Minamikawa","year":"2021","unstructured":"Minamikawa, N., Shioura, A.: Time bounds of basic steepest descent algorithms for M-convex function minimization and related problems. J. Oper. Res. Soc. Jpn. 64(2), 45\u201360 (2021)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"21_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718508","volume-title":"Discrete Convex Analysis","author":"K Murota","year":"2003","unstructured":"Murota, K.: Discrete Convex Analysis. SIAM, Philadelphia (2003)"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/040618710","volume":"20","author":"K Murota","year":"2006","unstructured":"Murota, K.: M-convex functions on jump systems: a general framework for minsquare graph factor. SIAM J. Discret. Math. 20, 213\u2013226 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-25960-2_11","volume-title":"Integer Programming and Combinatorial Optimization","author":"G Pap","year":"2004","unstructured":"Pap, G.: A TDI description of restricted 2-matching polytopes. In: Bienstock, D., Nemhauser, G. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 139\u2013151. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25960-2_11"},{"key":"21_CR23","unstructured":"Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, Heidelberg (2003)"},{"issue":"2","key":"21_CR24","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jctb.1993.1035","volume":"58","author":"A Seb\u0151","year":"1993","unstructured":"Seb\u0151, A.: General antifactors of graphs. J. Comb. Theory Ser.B 58(2), 174\u2013184 (1993)","journal-title":"J. Comb. Theory Ser.B"},{"issue":"3","key":"21_CR25","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1137\/07068494X","volume":"22","author":"J Szab\u00f3","year":"2008","unstructured":"Szab\u00f3, J.: Matroid parity and jump systems: A solution to a conjecture of Recski. SIAM J. Discret. Math. 22(3), 854\u2013860 (2008)","journal-title":"SIAM J. Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32726-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T14:02:23Z","timestamp":1702476143000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madison, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}