{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:21:45Z","timestamp":1742955705648,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_31","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"389-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted $$l_{\\infty }$$-norm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6311-8888","authenticated-orcid":false,"given":"Xianyue","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruowang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heping","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4191-7598","authenticated-orcid":false,"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1287\/opre.38.3.556","volume":"38","author":"O Ben-Ayed","year":"1990","unstructured":"Ben-Ayed, O., Blair, C.E.: Computational difficulties of bilevel linear programming. Oper. Res. 38(3), 556\u2013560 (1990)","journal-title":"Oper. Res."},{"key":"31_CR2","series-title":"Problem Books in Mathematics","doi-asserted-by":"publisher","first-page":"C1","DOI":"10.1007\/978-3-319-97686-0_15","volume-title":"Graph Theory","author":"V Chv\u00e1tal","year":"2018","unstructured":"Chv\u00e1tal, V.: Correction to: a De Bruijn-Erd\u0151s theorem in graphs? In: Gera, R., Haynes, T.W., Hedetniemi, S.T. (eds.) Graph Theory. PBM, pp. C1\u2013C2. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-97686-0_15"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.ejor.2007.04.031","volume":"188","author":"M-C Cai","year":"2008","unstructured":"Cai, M.-C., Duin, C.W., Yang, X., Zhang, J.: The partial inverse minimum spanning tree problem when weight increasing is forbidden. Eur. J. Oper. Res. 188, 348\u2013353 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1051\/ro\/2010017","volume":"44","author":"E Gassner","year":"2010","unstructured":"Gassner, E.: The partial inverse minimum cut problem with $$L_1$$-norm is strongly NP-hard. RAIRO Oper. Res. 44, 241\u2013249 (2010)","journal-title":"RAIRO Oper. Res."},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","author":"P Hansen","year":"1992","unstructured":"Hansen, P., Jaumard, B., Savard, G.: New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13, 1194\u20131217 (1992)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"31_CR6","unstructured":"Lai, T., Orlin, J.: The Complexity of Preprocessing. Research Report of Sloan School of Management. MIT (2003)"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.tcs.2016.06.002","volume":"640","author":"S Li","year":"2016","unstructured":"Li, S., Zhang, Z., Lai, H.-J.: Algorithms for constraint partial inverse matroid problem with weight increase forbidden. Theor. Comput. Sci. 640, 119\u2013124 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"31_CR8","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1007\/s10878-019-00433-x","volume":"38","author":"X Li","year":"2019","unstructured":"Li, X., Shu, X., Huang, H., Bai, J.: Capacitated partial inverse maximum spanning tree under the weighted Hamming distance. J. Comb. Optim. 38(4), 1005\u20131018 (2019). https:\/\/doi.org\/10.1007\/s10878-019-00433-x","journal-title":"J. Comb. Optim."},{"issue":"3","key":"31_CR9","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s10898-017-0554-5","volume":"70","author":"X Li","year":"2017","unstructured":"Li, X., Zhang, Z., Du, D.-Z.: Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$-norm. J. Glob. Optim. 70(3), 677\u2013685 (2017). https:\/\/doi.org\/10.1007\/s10898-017-0554-5","journal-title":"J. Glob. Optim."},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10898-019-00852-4","volume":"77","author":"X Li","year":"2019","unstructured":"Li, X., Zhang, Z., Yang, R., Zhang, H., Du, D.-Z.: Approximation algorithms for capacitated partial inverse maximum spanning tree problem. J. Glob. Optim. 77(2), 319\u2013340 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00852-4","journal-title":"J. Glob. Optim."},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1051\/ro:2001106","volume":"35","author":"X Yang","year":"2001","unstructured":"Yang, X.: Complexity of partial inverse assignment problem and partial inverse cut problem. RAIRO Oper. Res. 35, 117\u2013126 (2001)","journal-title":"RAIRO Oper. Res."},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.orl.2005.12.003","volume":"35","author":"X Yang","year":"2007","unstructured":"Yang, X., Zhang, J.: Partial inverse assignment problem under $$l_1$$ norm. Oper. Res. Lett. 35, 23\u201328 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10589-006-0394-6","volume":"36","author":"X Yang","year":"2007","unstructured":"Yang, X., Zhang, J.: Inverse sorting problem by minimizing the total weighted number of changers and partial inverse sorting problem. Comput. Optim. Appl. 36(1), 55\u201366 (2007)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"31_CR14","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s10898-016-0412-x","volume":"65","author":"Z Zhang","year":"2016","unstructured":"Zhang, Z., Li, S., Lai, H.-J., Du, D.-Z.: Algorithms for the partial inverse matroid problem in which weights can only be increased. J. Glob. Optim. 65(4), 801\u2013811 (2016). https:\/\/doi.org\/10.1007\/s10898-016-0412-x","journal-title":"J. Glob. Optim."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:06:26Z","timestamp":1639353986000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"62","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":"16","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":"8","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":"26% - 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":"4.2","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.75","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)"}}]}}