{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T16:01:43Z","timestamp":1781798503947,"version":"3.54.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T00:00:00Z","timestamp":1658707200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T00:00:00Z","timestamp":1658707200000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s11432-019-3017-9","type":"journal-article","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T18:12:04Z","timestamp":1659377524000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Solving multi-objective constrained minimum weighted bipartite assignment problem: a case study on energy-aware radio broadcast scheduling"],"prefix":"10.1007","volume":"65","author":[{"given":"Yupeng","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mingjie","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feifei","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,25]]},"reference":[{"key":"3017_CR1","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/978-3-319-44953-1_41","volume-title":"Proceedings of International Conference on Principles and Practice of Constraint Programming","author":"F Ma","year":"2016","unstructured":"Ma F, Gao X, Yin M, et al. Optimizing shortwave radio broadcast resource allocation via pseudo-boolean constraint solving and local search. In: Proceedings of International Conference on Principles and Practice of Constraint Programming, 2016. 650\u2013665"},{"key":"3017_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H W Kuhn","year":"1955","unstructured":"Kuhn H W. The Hungarian method for the assignment problem. Naval Res Logistics, 1955, 2: 83\u201397","journal-title":"Naval Res Logistics"},{"key":"3017_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres J. Algorithms for the assignment and transportation problems. J Soc Industrial Appl Math, 1957, 5: 32\u201338","journal-title":"J Soc Industrial Appl Math"},{"key":"3017_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/34.993558","volume":"24","author":"S Belongie","year":"2002","unstructured":"Belongie S, Malik J, Puzicha J. Shape matching and object recognition using shape contexts. IEEE Trans Pattern Anal Machine Intell, 2002, 24: 509\u2013522","journal-title":"IEEE Trans Pattern Anal Machine Intell"},{"key":"3017_CR5","first-page":"499","volume-title":"Proceedings of the 27th ACM\/IEEE Design Automation Conference","author":"C Y Huang","year":"1991","unstructured":"Huang C Y, Chen Y S, Lin Y L, et al. Data path allocation based on bipartite weighted matching. In: Proceedings of the 27th ACM\/IEEE Design Automation Conference, 1991. 499\u2013504"},{"key":"3017_CR6","doi-asserted-by":"publisher","first-page":"1982","DOI":"10.1137\/1.9781611975482.120","volume-title":"Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"R Reiffenh\u00e4user","year":"2019","unstructured":"Reiffenh\u00e4user R. An optimal truthful mechanism for the online weighted bipartite matching problem. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, 2019. 1982\u20131993"},{"key":"3017_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1145\/2983323.2983770","volume-title":"Proceedings of the 25th ACM International on Conference on Information and Knowledge Management","author":"C Chen","year":"2016","unstructured":"Chen C, Chester S, Srinivasan V, et al. Group-aware weighted bipartite b-matching. In: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, 2016. 459\u2013468"},{"key":"3017_CR8","volume-title":"Proceedings of the 2nd Conference on Language, Data and Knowledge (LDK 2019)","author":"J McCrae","year":"2019","unstructured":"McCrae J, Arcan M, Ahmadi S. Lexical sense alignment using weighted bipartite b-matching. In: Proceedings of the 2nd Conference on Language, Data and Knowledge (LDK 2019), 2019"},{"key":"3017_CR9","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-319-66158-2_26","volume-title":"Proceedings of International Conference on Principles and Practice of Constraint Programming","author":"L Pan","year":"2017","unstructured":"Pan L, Jin J, Gao X, et al. Integrating ILP and SMT for shortwave radio broadcast resource allocation and frequency assignment. In: Proceedings of International Conference on Principles and Practice of Constraint Programming, 2017. 405\u2013413"},{"key":"3017_CR10","doi-asserted-by":"publisher","first-page":"072102","DOI":"10.1007\/s11432-017-9324-0","volume":"62","author":"S J Wang","year":"2019","unstructured":"Wang S J, Wu T Y, Yao Y, et al. Constrained maximum weighted bipartite matching: a novel approach to radio broadcast scheduling. Sci China Inf Sci, 2019, 62: 072102","journal-title":"Sci China Inf Sci"},{"key":"3017_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ins.2018.11.006","volume":"478","author":"J Long","year":"2019","unstructured":"Long J, Sun Z, Pardalos P M, et al. A hybrid multi-objective genetic local search algorithm for the prize-collecting vehicle routing problem. Inf Sci, 2019, 478: 40\u201361","journal-title":"Inf Sci"},{"key":"3017_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/TWC.2003.808967","volume":"2","author":"S Salcedo-Sanz","year":"2003","unstructured":"Salcedo-Sanz S, Bousono-Calzon C, Figueiras-Vidal A R. A mixed neural-genetic algorithm for the broadcast scheduling problem. IEEE Trans Wirel Commun, 2003, 2: 277\u2013283","journal-title":"IEEE Trans Wirel Commun"},{"key":"3017_CR13","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s11276-012-0433-4","volume":"18","author":"D Arivudainambi","year":"2012","unstructured":"Arivudainambi D, Rekha D. An evolutionary algorithm for broadcast scheduling in wireless multihop networks. Wireless Netw, 2012, 18: 787\u2013798","journal-title":"Wireless Netw"},{"key":"3017_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C. Memetic algorithms and memetic computing optimization: a literature review. Swarm Evolary Comput, 2012, 2: 1\u201314","journal-title":"Swarm Evolary Comput"},{"key":"3017_CR15","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, et al. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Computat, 2002, 6: 182\u2013197","journal-title":"IEEE Trans Evol Computat"},{"key":"3017_CR16","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q F Zhang","year":"2007","unstructured":"Zhang Q F, Li H. MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Computat, 2007, 11: 712\u2013731","journal-title":"IEEE Trans Evol Computat"},{"key":"3017_CR17","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1109\/TEVC.2014.2350995","volume":"19","author":"X Y Cai","year":"2015","unstructured":"Cai X Y, Li Y X, Fan Z, et al. An external archive guided multiobjective evolutionary algorithm based on decomposition for combinatorial optimization. IEEE Trans Evol Computat, 2015, 19: 508\u2013523","journal-title":"IEEE Trans Evol Computat"},{"key":"3017_CR18","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.swevo.2018.08.017","volume":"44","author":"Z Fan","year":"2019","unstructured":"Fan Z, Li W, Cai X, et al. Push and pull search for solving constrained multi-objective optimization problems. Swarm Evolary Comput, 2019, 44: 665\u2013679","journal-title":"Swarm Evolary Comput"},{"key":"3017_CR19","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi H, Murata T. A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybern C, 1998, 28: 392\u2013403","journal-title":"IEEE Trans Syst Man Cybern C"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-019-3017-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-019-3017-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-019-3017-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T21:03:12Z","timestamp":1693774992000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-019-3017-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,25]]},"references-count":19,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["3017"],"URL":"https:\/\/doi.org\/10.1007\/s11432-019-3017-9","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,25]]},"assertion":[{"value":"3 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"182101"}}