minimum markup_markup和margin_minimumversion(5)

[103] Zhang HL, Tong WT,Xu YF, Lin GH; The Steiner traveling salesman problem with online advanced edge blockages. Computers & OR 70: 26-38 (2016)

[102] Li HM,Xu YF; Minimax regret 1-sink location problem with accessibility in dynamic general networks. European Journal of Operational Research 250(2): 360-366 (2016)

[101] Li HM,Xu YF, Ni GQ; Minimax regret vertex 2-sink location problem in dynamic path networks. J. Comb. Optim. 31(1): 79-94 (2016)

[100] Feng X, Cheng YX, Zheng FF,Xu YF; Online integrated production-distribution scheng problems without preemption. J. Comb. Optim. 31(4): 1569-1585 (2016)

[99] Luo TB,Xu YF; Optimal algorithm for semi-online scheng on two machines under GoS levels. Optimization Letters 10(1): 207-213 (2016)

[98] Hu JL, Luo TB, Su XT, Dong JM, Tong WT, Goebel R,Xu YF, Lin GH; Machine scheng with a maintenance interval and job delivery coordination.: 1645-1656 (2016)

[97] Wang Y,Xu YF; The approximation algorithms for a class of multiple-choice problem.: 164-174 (2016)

[96] Ni GQ, Luo L,Xu YF, Xu JP, Dong YC; Optimal decisions on group buying option with a posted retail price and heterogeneous demand. Electronic Commerce Research and Applications 14(1): 23-33 (2015)

[95] Zhang HL, Tong WT,Xu YF, Lin GH; The Steiner Traveling Salesman Problem with online edge blockages. European Journal of Operational Research 243(1): 30-40 (2015)

[94]Xu YF, Li HM; Minimax regret 1-sink location problem in dynamic cycle networks. Inf. Process. Lett. 115(2): 163-169 (2015)

本文来自电脑杂谈，转载请注明本文网址：
http://www.pc-fly.com/a/tongxinshuyu/article-51865-5.html