相关文章推荐
星星上的毛豆  ·  tomcat10 javaweb ...·  1 月前    · 
一直单身的桔子  ·  wangzengdi's Blog·  6 月前    · 
犯傻的水桶  ·  java时间取整-掘金·  1 年前    · 
刚毅的花卷  ·  对‘Json::Value::operato ...·  1 年前    · 
霸气的烈马  ·  PHP ftp_nb_put() 函数 | ...·  1 年前    · 
[1] Journal of the Operations Research Society of China. 2023, 第 1 作者[2] Cao, Zhigang, Chen, Bo, Chen, Xujin, Wang, Changjun. Bounding residence times for atomic dynamic routings. Mathematics of Operations Research[J]. 2022, 第 4 作者  通讯作者  47(4): 3261-3281, https://doi.org/10.1287/moor.2021.1242.[3] Xujin Chen, Minming Li, Changjun Wang, Chenhao Wang, Mengqi Zhang, Yingchao Zhao. Mechanisms for dual-role-facility location games: Truthfulness and approximability. Theoretical Computer Science[J]. 2022, 第 3 作者932: 69-83, http://dx.doi.org/10.1016/j.tcs.2022.08.007.[4] Nip, Kameng, Wang, Changjun, Wang, Zizhuo. Competitive and Cooperative Assortment Games under Markov Chain Choice Model. Production and Operations Management[J]. 2022, 第 2 作者31(3): 1033-1051, http://dx.doi.org/10.1111/poms.13593.[5] Cao, Zhigang, Chen, Bo, Chen, Xujin, Wang, Changjun. Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents. Operations Research[J]. 2021, 第 4 作者  通讯作者  69(6): 1680-1695, http://dx.doi.org/10.1287/opre.2021.2105.[6] Cao, Zhigang, Chen, Xujin, Qin, ChengZhong, Wang, Changjun, Yang, Xiaoguang. Embedding games with strategic complements into games with strategic substitutes. JOURNAL OF MATHEMATICAL ECONOMICS[J]. 2018, 第 4 作者78: 45-51, http://ir.amss.ac.cn/handle/2S8OKBNM/31682.[7] Xujin Chen, Xiaodong Hu, Changjun Wang. Finding connected k-subgraphs with high density. INFORMATION AND COMPUTATION. 2017, 第 3 作者256: 160-173, http://dx.doi.org/10.1016/j.ic.2017.07.003.[8] Cao, Zhigang, Chen, Xujin, Hu, Xiaodong, Wang, Changjun. Approximation algorithms for pricing with negative network externalities. JOURNAL OF COMBINATORIAL OPTIMIZATION[J]. 2017, 第 4 作者  通讯作者  33(2): 681-712, https://www.webofscience.com/wos/woscc/full-record/WOS:000394241000019.[9] Chen, Xujin, Hu, Xiaodong, Wang, Changjun. Approximation for the minimum cost doubly resolving set problem. THEORETICAL COMPUTER SCIENCE[J]. 2016, 第 3 作者  通讯作者  609: 526-543, http://dx.doi.org/10.1016/j.tcs.2015.03.048.[10] Chen, Xujin, Hu, Xiaodong, Liu, TieYan, Ma, Weidong, Qin, Tao, Tang, Pingzhong, Wang, Changjun, Zheng, Bo. Efficient Mechanism Design for Online Scheduling. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH[J]. 2016, 第 7 作者56: 429-461, https://www.webofscience.com/wos/woscc/full-record/WOS:000396193800001.[11] Cao, Zhigang, Chen, Xujin, Wang, Changjun. Schedules for marketing products with negative externalities. THEORETICAL COMPUTER SCIENCE[J]. 2014, 第 3 作者554: 191-206, http://dx.doi.org/10.1016/j.tcs.2014.01.008.[12] Chen, Xujin, Hu, Xiaodong, Ma, Weidong, Wang, Changjun. Reducing price of anarchy of selfish task allocation with more selfishness. THEORETICAL COMPUTER SCIENCE[J]. 2013, 第 4 作者507: 17-33, http://dx.doi.org/10.1016/j.tcs.2013.02.019.