乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T05:16:19Z","timestamp":1648703779254},"reference-count":39,"publisher":"Pleiades Publishing Ltd","issue":"8","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1134\/s0361768820080174","type":"journal-article","created":{"date-parts":[[2020,12,22]],"date-time":"2020-12-22T12:03:01Z","timestamp":1608638581000},"page":"661-678","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mixed Integer Programming Formulations for Steiner Tree and Quality of Service Multicast Tree Problems"],"prefix":"10.1134","volume":"46","author":[{"given":"C.","family":"Risso","sequence":"first","affiliation":[]},{"given":"F.","family":"Robledo","sequence":"additional","affiliation":[]},{"given":"S.","family":"Nesmachnow","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2020,12,22]]},"reference":[{"key":"3557_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, R., Watkins, J., Wolff, A., Angelini, P., Darabi, F., Efrat, A., Glickenstein, D., Gronemann, M., Heinsohn, N., Kobourov, S., and Spence, R., Multi-level Steiner trees, J. Experim. Algorithmics, 2019, vol.\u00a024, no. 1.","DOI":"10.1145\/3368621"},{"key":"3557_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"10","author":"Y. Aneja","year":"1980","unstructured":"Aneja, Y., An integer linear programming approach to the Steiner problem in graphs, Networks, 1980, vol. 10, no. 2, pp. 167\u2013178.","journal-title":"Networks"},{"key":"3557_CR3","doi-asserted-by":"crossref","unstructured":"Angelopoulos, S., A near-tight bound for the online steiner tree problem in graphs of bounded asymmetry, in Proc. European Symp, on Algorithms, Berlin, Heidelberg: Springer, 2008, pp. 76\u201387.","DOI":"10.1007\/978-3-540-87744-8_7"},{"key":"3557_CR4","volume-title":"The Oxford Handbook of Information and Communication Technologies","year":"2009","unstructured":"The Oxford Handbook of Information and Communication Technologies, Avgerou, C., Mansell, R., Quah, D., and Silverstone, R., Eds., Oxford Univ. Press, 2009."},{"key":"3557_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230190102","volume":"19","author":"J. Beasley","year":"1989","unstructured":"Beasley, J., An SST-based algorithm for the Steiner problem in graphs, Networks, 1989, vol. 19, no. 1, pp.\u00a01\u201316.","journal-title":"Networks"},{"key":"3557_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1541885.1541892","volume":"5","author":"G. Borradaile","year":"2009","unstructured":"Borradaile, G., Klein, P., and Mathieu, C., An O(nlogn) approximation scheme for Steiner tree in planar graphs, ACM Trans. Algorithms, 2009, vol. 5, no. 3, pp. 1\u201331.","journal-title":"ACM Trans. Algorithms"},{"key":"3557_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85097-7_18","volume-title":"Strong formulations for 2-node-connected Steiner network problems","author":"M. Chimani","year":"2008","unstructured":"Chimani, M., Kandyba, M., Ljubic, I., and Mutzel, P., Strong formulations for 2-node-connected Steiner network problems, Proc. Combinatorial Optimization and Applications, St. John\u2019s, 2008, pp. 190\u2013200."},{"key":"3557_CR8","doi-asserted-by":"crossref","unstructured":"Duin, C. and Vo\u00df, S., Steiner tree heuristics \u2013 a survey, in Operations Research Proc., 1993, pp. 485\u2013496.","DOI":"10.1007\/978-3-642-78910-6_160"},{"key":"3557_CR9","volume-title":"Flows in Networks","author":"L. Ford","year":"2010","unstructured":"Ford, L. and Fulkerson, D., Flows in Networks, Princeton: Princeton Univ. Press, 2010."},{"key":"3557_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/0471728489","volume-title":"Telecommunication System Engineering","author":"R. Freeman","year":"2004","unstructured":"Freeman, R., Telecommunication System Engineering, John Wiley & Sons Inc., 2004."},{"key":"3557_CR11","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1109\/TMM.2015.2438713","volume":"17","author":"Guanyu Gao","year":"2015","unstructured":"Guanyu Gao, Weiwen Zhang, Yong Wen, Zhi Wang, and Wenwu Zhu, Towards cost-efficient video transcoding in media cloud: insights learned from user viewing patterns, IEEE Trans. Multimedia, 2015, vol.\u00a017, no. 8, pp. 1286\u20131296.","journal-title":"IEEE Trans. Multimedia"},{"key":"3557_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/49.552065","volume":"15","author":"E. Gelenbe","year":"1997","unstructured":"Gelenbe, E., Ghanwani, A., and Srinivasan, V., Improved neural heuristics for multicast routing, IEEE J. Select. Areas Commun., 1997, vol. 15, no. 2, pp. 147\u2013155.","journal-title":"IEEE J. Select. Areas Commun."},{"key":"3557_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230230104","volume":"23","author":"M. Goemans","year":"1993","unstructured":"Goemans M. and Young-Soo Myung, A catalog of Steiner tree formulations, Networks, 1993, vol. 23, no. 1, pp. 19\u201328.","journal-title":"Networks"},{"key":"3557_CR14","volume-title":"A compendium on Steiner tree problems, Tech. Rep.","author":"M. Hauptmann","year":"2014","unstructured":"Hauptmann, M. and Karpinski, M., A compendium on Steiner tree problems, Tech. Rep., Department of Computer Science and Hausdorff Center for Mathematics Univ. of Bonn, 2014."},{"key":"3557_CR15","doi-asserted-by":"crossref","unstructured":"Menglan Hu, Jun Luo, Yang Wang, and Bharadwa j Veeravalli, Practical resource provisioning and caching with dynamic resilience for cloud-based content distribution networks, IEEE Trans. Parallel Distribut. Syst., 2014, vol. 25, no. 8, pp. 2169\u20132179.","DOI":"10.1109\/TPDS.2013.287"},{"key":"3557_CR16","unstructured":"ILOG CPLEX. Terminating MIP Optimization. http:\/\/www.eio.upc.es\/lceio\/manuals\/cplex-11\/html\/usrcplex\/solveMIP10.html. Jan. 2020."},{"key":"3557_CR17","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1134\/S0361768819080127","volume":"45","author":"S. Iturriaga","year":"2019","unstructured":"Iturriaga, S., Nesmachnow, S., Go\u00f1i, G., Dorronsoro, B., and Tchernykh, A., Evolutionary algorithms for optimizing cost and QoS on cloud-based content distribution networks, Program. Comput. Software, 2019, vol. 45, pp.\u00a0544\u2013556.","journal-title":"Program. Comput. Software"},{"key":"3557_CR18","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"Narendra Karmarkar","year":"1984","unstructured":"Narendra Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 1984, vol.\u00a04, no. 4, pp. 373\u2013395.","journal-title":"Combinatorica"},{"key":"3557_CR19","series-title":"Reducibility among combinatorial problems","volume-title":"Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp, R., Reducibility among combinatorial problems, in Complexity of Computer Computations, Miller, R. and Thatcher, J., Eds., New York: Plenum Press, 1972, pp.\u00a085\u2013103."},{"key":"3557_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00453-004-1133-y","volume":"42","author":"M. Karpinski","year":"2005","unstructured":"Karpinski, M., Mandoiu, I., Olshevsky, A., and Zelikovsky, A., Improved approximation algorithms for the quality of service multicast tree problem, Algorithmica, 2005, vol. 42, no. 2, pp. 109\u2013120.","journal-title":"Algorithmica"},{"key":"3557_CR21","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.comnet.2018.02.016","volume":"135","author":"W. Khallef","year":"2018","unstructured":"Khallef, W., Durand, S., and Moln\u00e1r, M., ILP formulation of the exact solution of multi-constrained minimum cost multicast, Comput. Networks, 2018, vol. 135, pp. 160\u2013170.","journal-title":"Comput. Networks"},{"key":"3557_CR22","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.ins.2013.03.006","volume":"238","author":"Moonseong Kim","year":"2013","unstructured":"Moonseong Kim, Hyunseung Choo, Matt Mutka, Hyung-Jin Lim, and Kwangjin Park, On QoS multicast routing algorithms using k-minimum Steiner trees, Inf. Sci., 2013, vol. 238, pp. 190\u2013204.","journal-title":"Inf. Sci."},{"key":"3557_CR23","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T. Koch","year":"1998","unstructured":"Koch, T. and Martin, A., Solving Steiner tree problems in graphs to optimality, Networks, 1998, vol. 32, no. 3, pp. 207\u2013232.","journal-title":"Networks"},{"key":"3557_CR24","doi-asserted-by":"crossref","unstructured":"Koch, T., Martin, A., and Vo\u00df, S., SteinLib: an updated library on Steiner tree problems in graphs, in Combinatorial Optimization, Springer US, 2001, pp. 285\u2013325.","DOI":"10.1007\/978-1-4613-0255-1_9"},{"key":"3557_CR25","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawler","year":"2011","unstructured":"Lawler, E., Combinatorial Optimization: Networks and Matroids, Dover Publ., 2011."},{"key":"3557_CR26","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.dam.2011.07.008","volume":"164","author":"V. Leggieri","year":"2014","unstructured":"Leggieri, V., Haouari, M., and Triki, C., The Steiner tree problem with delays: a compact formulation and reduction procedures, Discrete Appl. Math., 2014, vol.\u00a0164, pp. 178\u2013190.","journal-title":"Discrete Appl. Math."},{"key":"3557_CR27","doi-asserted-by":"publisher","first-page":"3483","DOI":"10.1002\/cpe.3466","volume":"27","author":"Lei Liu","year":"2015","unstructured":"Lei Liu, Hua Wang, and Guohong Kong, An improved EDA for solving Steiner tree problem, Concurrency Comput.: Pract. Exper., 2015, vol. 27, no. 13, pp. 3483\u20133496.","journal-title":"Concurrency Comput.: Pract. Exper."},{"key":"3557_CR28","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/A:1026546708757","volume":"17","author":"S. Martins","year":"2000","unstructured":"Martins, S., Resende, M., Ribeiro, C., and Pardalos, P., J. Global Optim., 2000, vol. 17, no. 1\/4, pp. 267\u2013283.","journal-title":"J. Global Optim."},{"key":"3557_CR29","first-page":"221","volume":"28","author":"M. Minoux","year":"1990","unstructured":"Minoux, M., Efficient greedy heuristics for Steiner tree problems using reolptimization and super modularity, Inf. Syst. Oper. Res., 1990, vol. 28, no. 3, pp. 221\u2013233.","journal-title":"Inf. Syst. Oper. Res."},{"key":"3557_CR30","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01585735","volume":"46","author":"C. Monma","year":"1990","unstructured":"Monma, C., Munson, B., and Pulleyblank, W., Minimum-weight two-connected spanning networks, Math. Program., 1990, vol. 46, no. 1\u20133, pp. 153\u2013171.","journal-title":"Math. Program."},{"key":"3557_CR31","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1504\/IJMHEUR.2014.068914","volume":"3","author":"S. Nesmachnow","year":"2014","unstructured":"Nesmachnow, S., An overview of metaheuristics: accurate and efficient methods for optimisation, Int. J. Metaheuristics, 2014, vol. 3, no. 4, p. 320.","journal-title":"Int. J. Metaheuristics"},{"key":"3557_CR32","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0166-218X(00)00319-X","volume":"112","author":"T. Polzin","year":"2001","unstructured":"Polzin, T. and Daneshmand, S., Improved algorithms for the Steiner problem in networks, Discrete Appl. Math., 2001, vol. 112, no. 1\u20133, pp. 263\u2013300.","journal-title":"Discrete Appl. Math."},{"key":"3557_CR33","first-page":"228","volume":"14","author":"C. Ribeiro","year":"2002","unstructured":"Ribeiro, C., Uchoa, E., and Werneck, R., J. Comput., 2002, vol. 14, no. 3, pp. 228\u2013246.","journal-title":"J. Comput."},{"key":"3557_CR34","doi-asserted-by":"crossref","unstructured":"Siebert, M., Ahmed, S., and Nemhauser, G., A linear programming based approach to the Steiner tree problem with a fixed number of terminals, Networks, 2020, vol. 75, no. 2.","DOI":"10.1002\/net.21913"},{"key":"3557_CR35","doi-asserted-by":"publisher","first-page":"41","DOI":"10.15837\/ijccc.2006.1.2271","volume":"1","author":"M. Stanojevic","year":"2006","unstructured":"Stanojevic, M. and Vujosevic, M., An exact algorithm for Steiner tree problem on graphs, Int. J. Comput., Commun. Control, 2006, vol. 1, no. 1, pp. 41\u201346.","journal-title":"Int. J. Comput., Commun. Control"},{"key":"3557_CR36","unstructured":"Xinhui Wang, Exact algorithms for the Steiner tree problem, PhD Thesis, Department of Applied Mathematics, Faculty of Electrical Engineering, Mathematics and Computer Science of the University of Twente, 2008."},{"key":"3557_CR37","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R. Wong","year":"1984","unstructured":"Wong, R., A dual ascent approach for Steiner tree problems on a directed graph, Math. Program., 1984, vol. 28, no. 3, pp. 271\u2013287.","journal-title":"Math. Program."},{"key":"3557_CR38","doi-asserted-by":"publisher","first-page":"1954","DOI":"10.1109\/TPDS.2015.2470676","volume":"27","author":"Wenhua Xiao","year":"2016","unstructured":"Wenhua Xiao, Weidong Bao, Xiaomin Zhu, Chen Wang, Lidong Chen, and Yang, L.T., Dynamic request redirection and resource provisioning for cloud-based video services under heterogeneous environment, IEEE Trans. Parallel Distribut. Syst., 2016, vol. 27, no. 7, pp.\u00a01954\u20131967.","journal-title":"IEEE Trans. Parallel Distribut. Syst."},{"key":"3557_CR39","doi-asserted-by":"crossref","unstructured":"Weijun Yang and Yuanfeng Chen, A novel QoS provisioning algorithm for optimal ulticast routing in WMNs, Future Internet, 2016, vol. 8, no. 3.","DOI":"10.3390\/fi8030038"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768820080174.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1134\/S0361768820080174\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768820080174.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,22]],"date-time":"2020-12-22T12:07:30Z","timestamp":1608638850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1134\/S0361768820080174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":39,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["3557"],"URL":"https:\/\/doi.org\/10.1134\/s0361768820080174","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"5 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}