{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T13:23:46Z","timestamp":1770125026391,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T00:00:00Z","timestamp":1769990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T00:00:00Z","timestamp":1769990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72571205;72101200"],"award-info":[{"award-number":["72571205;72101200"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ByteDance Research Project","award":["CT20221028001221"],"award-info":[{"award-number":["CT20221028001221"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s12351-026-01022-7","type":"journal-article","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T14:03:29Z","timestamp":1770041009000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Column generation-based diving heuristic and segmentation approach for the micro-service allocation problem with affinity in cloud computing"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9034-010X","authenticated-orcid":false,"given":"Ning","family":"Ma","sequence":"first","affiliation":[]},{"given":"Angjun","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7522-061X","authenticated-orcid":false,"given":"Fuxin","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Zuzhi","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,2]]},"reference":[{"key":"1022_CR1","doi-asserted-by":"publisher","first-page":"2944","DOI":"10.1016\/j.cor.2009.01.008","volume":"36","author":"C Alves","year":"2009","unstructured":"Alves C, Macedo R, de Carvalho JV (2009) New lower bounds based on column generation and constraint programming for the pattern minimization problem. Computers & Operations Research 36:2944\u20132954","journal-title":"Computers & Operations Research"},{"key":"1022_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ejor.2013.08.011","volume":"233","author":"C Alves","year":"2014","unstructured":"Alves C, de Carvalho JV, Clautiaux F, Rietz J (2014) Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem. Eur J Oper Res 233:43\u201363","journal-title":"Eur J Oper Res"},{"key":"1022_CR3","doi-asserted-by":"crossref","unstructured":"Amarante SRM, Roberto FM, Cardoso AR, Celestino J, (2013) Using the multiple knapsack problem to model the problem of virtual machine allocation in cloud computing, in: 2013 IEEE 16th International Conference on Computational Science and Engineering, pp. 476\u2013483","DOI":"10.1109\/CSE.2013.77"},{"key":"1022_CR4","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.ijpe.2013.04.040","volume":"145","author":"JA Bennell","year":"2013","unstructured":"Bennell JA, Lee LS, Potts CN (2013) A genetic algorithm for two-dimensional bin packing with due dates. Int J Prod Econ 145:547\u2013560","journal-title":"Int J Prod Econ"},{"key":"1022_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Sim M (2004) The price of robustness OPERATIONS RESEARCH 52:35\u201353","journal-title":"The price of robustness OPERATIONS RESEARCH"},{"key":"1022_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109780","volume":"131","author":"W Bi","year":"2022","unstructured":"Bi W, Ma J, Zhu X, Wang W, Zhang A (2022) Cloud service selection based on weighted KD tree nearest neighbor search. Appl Soft Comput 131:109780","journal-title":"Appl Soft Comput"},{"key":"1022_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2016.06.009","volume":"76","author":"M Buljuba\u0161i\u0107","year":"2016","unstructured":"Buljuba\u0161i\u0107 M, Vasquez M (2016) Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Computers & Operations Research 76:12\u201321","journal-title":"Computers & Operations Research"},{"key":"1022_CR8","doi-asserted-by":"crossref","unstructured":"Campello B, Ghidini C, Ayres A, Oliveira W (2021) A residual recombination heuristic for one-dimensional cutting stock problems. TOP , 1\u201327","DOI":"10.1007\/s11750-021-00611-3"},{"key":"1022_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0166-218X(00)00267-5","volume":"111","author":"A Caprara","year":"2001","unstructured":"Caprara A, Toth P (2001) Lower bounds and algorithms for the 2-dimensional vector packing problem. Discret Appl Math 111:231\u2013262","journal-title":"Discret Appl Math"},{"key":"1022_CR10","first-page":"1571","volume-title":"2021 Fifth International Conference on I-SMAC (IoT in Social","author":"PJ Charles","year":"2021","unstructured":"Charles PJ, Stanislaus UL (2021) Secure virtual machine migration using ant colony algorithm. 2021 Fifth International Conference on I-SMAC (IoT in Social. Mobile, Analytics and Cloud)(I-SMAC), IEEE, pp 1571\u20131575"},{"key":"1022_CR11","doi-asserted-by":"crossref","unstructured":"da\u00a0Silva RF, Schouery R (2023) A branch-and-cut-and-price algorithm for cutting stock and related problems. arXiv preprint arXiv:2308.03595","DOI":"10.5753\/reic.2024.4646"},{"key":"1022_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102788","volume":"169","author":"R Fayos-Jordan","year":"2020","unstructured":"Fayos-Jordan R, Felici-Castell S, Segura-Garcia J, Lopez-Ballester J, Cobos M (2020) Performance comparison of container orchestration platforms with low cost devices in the fog, assisting internet of things applications. J Netw Comput Appl 169:102788","journal-title":"J Netw Comput Appl"},{"key":"1022_CR13","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/j.ejor.2016.11.003","volume":"259","author":"AN Gullhav","year":"2017","unstructured":"Gullhav AN, Cordeau JF, Hvattum LM, Nygreen B (2017) Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds. Eur J Oper Res 259:829\u2013846","journal-title":"Eur J Oper Res"},{"key":"1022_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.113165","volume":"147","author":"L Heilig","year":"2020","unstructured":"Heilig L, Lalla-Ruiz E, Vo\u00df S (2020) Modeling and solving cloud service purchasing in multi-cloud environments. Expert Syst Appl 147:113165","journal-title":"Expert Syst Appl"},{"key":"1022_CR15","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2018.04.047","volume":"271","author":"K He\u00dfler","year":"2018","unstructured":"He\u00dfler K, Gschwind T, Irnich S (2018) Stabilized branch-and-price algorithms for vector packing problems. Eur J Oper Res 271:401\u2013419","journal-title":"Eur J Oper Res"},{"key":"1022_CR16","first-page":"1","volume-title":"2020 Emerging Technology in Computing","author":"MK Hossain","year":"2020","unstructured":"Hossain MK, Rahman M, Hossain A, Rahman SY, Islam MM (2020) Active & idle virtual machine migration algorithm-a new ant colony optimization approach to consolidate virtual machines and ensure green cloud computing. 2020 Emerging Technology in Computing. IEEE, Communication and Electronics (ETCCE), pp 1\u20136"},{"key":"1022_CR17","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2016.12.021","volume":"260","author":"Q Hu","year":"2017","unstructured":"Hu Q, Zhu W, Qin H, Lim A (2017) A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function. Eur J Oper Res 260:70\u201380","journal-title":"Eur J Oper Res"},{"key":"1022_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.omega.2017.01.006","volume":"74","author":"Q Hu","year":"2018","unstructured":"Hu Q, Wei L, Lim A (2018) The two-dimensional vector packing problem with general costs. Omega 74:59\u201369","journal-title":"Omega"},{"key":"1022_CR19","doi-asserted-by":"publisher","first-page":"4663","DOI":"10.3390\/app9214663","volume":"9","author":"Y Hu","year":"2019","unstructured":"Hu Y, Laat C, Zhao Z (2019) Optimizing service placement for microservice architecture in clouds. Appl Sci 9:4663","journal-title":"Appl Sci"},{"key":"1022_CR20","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/j.future.2019.08.025","volume":"102","author":"Y Hu","year":"2020","unstructured":"Hu Y, Zhou H, de Laat C, Zhao Z (2020) Concurrent container scheduling on heterogeneous clusters with multi-resource constraints. Futur Gener Comput Syst 102:562\u2013573","journal-title":"Futur Gener Comput Syst"},{"key":"1022_CR21","doi-asserted-by":"crossref","unstructured":"Hu Y, Ding H, Chen H, He J, Hu M, Cai C, Peng K (2025) Collaborative orchestration with probabilistic routing for dynamic service mesh in clouds, in: IEEE INFOCOM 2025 - IEEE Conference on Computer Communications, pp. 1\u201310","DOI":"10.1109\/INFOCOM55648.2025.11044542"},{"key":"1022_CR22","doi-asserted-by":"crossref","unstructured":"Marchese A, Tomarchio O (2024) Network slo-aware container orchestration on kubernetes clusters, in: International Conference on Service-Oriented Computing, Springer. pp. 96\u2013104","DOI":"10.1007\/978-981-96-0808-9_8"},{"key":"1022_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1287\/ijoc.1040.0089","volume":"18","author":"M Monaci","year":"2006","unstructured":"Monaci M, Toth P (2006) A set-covering-based heuristic approach for bin-packing problems. INFORMS J Comput 18:71\u201385","journal-title":"INFORMS J Comput"},{"key":"1022_CR24","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.cor.2019.05.013","volume":"109","author":"M Ning","year":"2019","unstructured":"Ning M, Ya L, Zhili Z (2019) Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost. Computers & Operations Research 109:218\u2013229","journal-title":"Computers & Operations Research"},{"key":"1022_CR25","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1109\/TSC.2025.3526373","volume":"18","author":"K Peng","year":"2025","unstructured":"Peng K, Hu Y, Ding H, Chen H, Wang L, Cai C, Hu M (2025) Large-scale service mesh orchestration with probabilistic routing in cloud data centers. IEEE Trans Serv Comput 18:868\u2013882","journal-title":"IEEE Trans Serv Comput"},{"key":"1022_CR26","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1016\/j.cor.2008.07.001","volume":"36","author":"KC Poldi","year":"2009","unstructured":"Poldi KC, Arenales MN (2009) Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths. Computers & Operations Research 36:2074\u20132081","journal-title":"Computers & Operations Research"},{"key":"1022_CR27","doi-asserted-by":"crossref","unstructured":"Puliafito C, Cicconetti C, Conti M, Mingozzi E, Passarella A (2023) Balancing local vs. remote state allocation for micro-services in the cloud-edge continuum. Pervasive and Mobile Computing , 101808","DOI":"10.1016\/j.pmcj.2023.101808"},{"key":"1022_CR28","doi-asserted-by":"crossref","unstructured":"Raith P, Rattihalli G, Dhakal A, Chalamalasetti SR, Milojicic D, Frachtenberg E, Nastic S, Dustdar S (2024) Opportunistic energy-aware scheduling for container orchestration platforms using graph neural networks, in: 2024 IEEE 24th International Symposium on Cluster, Cloud and Internet Computing (CCGrid), pp. 299\u2013306","DOI":"10.1109\/CCGrid59990.2024.00042"},{"key":"1022_CR29","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1287\/ijoc.2018.0822","volume":"31","author":"R Sadykov","year":"2019","unstructured":"Sadykov R, Vanderbeck F, Pessoa A, Tahiri I, Uchoa E (2019) Primal heuristics for branch and price: The assets of diving methods. INFORMS J Comput 31:251\u2013267","journal-title":"INFORMS J Comput"},{"key":"1022_CR30","doi-asserted-by":"publisher","first-page":"4461","DOI":"10.1109\/TNSM.2023.3271415","volume":"20","author":"J Santos","year":"2023","unstructured":"Santos J, Wang C, Wauters T, De Turck F (2023) Diktyo: Network-aware scheduling in container-based clouds. IEEE Trans Netw Serv Manage 20:4461\u20134477","journal-title":"IEEE Trans Netw Serv Manage"},{"key":"1022_CR31","doi-asserted-by":"crossref","unstructured":"Sheoran A, Fahmy S, Sharma P, Modi N (2021) Invenio: Communication affinity computation for low-latency microservices, in: Proceedings of the Symposium on Architectures for Networking and Communications Systems, pp. 88\u2013101","DOI":"10.1145\/3493425.3502750"},{"key":"1022_CR32","doi-asserted-by":"publisher","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"HD Sherali","year":"2001","unstructured":"Sherali HD, Smith JC (2001) Improving discrete model representations via symmetry considerations. Manage Sci 47:1396\u20131407","journal-title":"Manage Sci"},{"key":"1022_CR33","doi-asserted-by":"crossref","unstructured":"Song E, Song Y, Lu C, Pan T, Zhang S, Lu J, Zhao J, Wang X, Wu X, Gao M, et\u00a0al. (2024) Canal mesh: A cloud-scale sidecar-free multi-tenant service mesh architecture, in: Proceedings of the ACM SIGCOMM 2024 Conference, pp. 860\u2013875","DOI":"10.1145\/3651890.3672221"},{"key":"1022_CR34","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0305-0548(94)90059-0","volume":"21","author":"FC Spieksma","year":"1994","unstructured":"Spieksma FC (1994) A branch-and-bound algorithm for the two-dimensional vector packing problem. Computers & operations research 21:19\u201325","journal-title":"Computers & operations research"},{"key":"1022_CR35","doi-asserted-by":"crossref","unstructured":"Ullah A, Nawi NM, Ouhame S (2022) Recent advancement in vm task allocation system for cloud computing: review from 2015 to2021. Artificial Intelligence Review , 1\u201345","DOI":"10.1007\/s10462-021-10071-7"},{"key":"1022_CR36","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"J Val\u00e9rio de Carvalho","year":"1999","unstructured":"Val\u00e9rio de Carvalho J (1999) Exact solution of bin-packing problems using column generation and branch-and-bound. Ann Oper Res 86:629\u2013659","journal-title":"Ann Oper Res"},{"key":"1022_CR37","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jnca.2018.07.003","volume":"119","author":"X Wan","year":"2018","unstructured":"Wan X, Guan X, Wang T, Bai G, Choi BY (2018) Application deployment using microservice and docker containers: Framework and optimization. J Netw Comput Appl 119:97\u2013109","journal-title":"J Netw Comput Appl"},{"key":"1022_CR38","doi-asserted-by":"crossref","unstructured":"Wang Z, Goudarzi M, Aryal J, Buyya R (2022) Container orchestration in edge and fog computing environments for real-time iot applications, in: Computational Intelligence and Data Analytics: Proceedings of ICCIDA 2022. Springer, pp. 1\u201321","DOI":"10.1007\/978-981-19-3391-2_1"},{"key":"1022_CR39","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher G, Hau\u00dfner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183:1109\u20131130","journal-title":"Eur J Oper Res"},{"key":"1022_CR40","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ejor.2019.08.024","volume":"281","author":"L Wei","year":"2020","unstructured":"Wei L, Lai M, Lim A, Hu Q (2020) A branch-and-price algorithm for the two-dimensional vector packing problem. Eur J Oper Res 281:25\u201335","journal-title":"Eur J Oper Res"},{"key":"1022_CR41","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1287\/ijoc.2018.0867","volume":"32","author":"L Wei","year":"2020","unstructured":"Wei L, Luo Z, Baldacci R, Lim A (2020) A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems. INFORMS J Comput 32:428\u2013443","journal-title":"INFORMS J Comput"},{"key":"1022_CR42","doi-asserted-by":"crossref","unstructured":"Yekollu RK, Haldikar SV, Ghuge TB, Kader OFMA, Biradar SS (2024) Resource management and scalability in container orchestration platforms: A comparative study, in: 2024 IEEE 16th International Conference on Computational Intelligence and Communication Networks (CICN), IEEE. pp. 1146\u20131151","DOI":"10.1109\/CICN63059.2024.10847490"},{"key":"1022_CR43","doi-asserted-by":"crossref","unstructured":"Zhang D, Yan BH, Feng Z, Zhang C, Wang YX (2017) Container oriented job scheduling using linear programming model, in: 2017 3rd International Conference on Information Management (ICIM), pp. 174\u2013180","DOI":"10.1109\/INFOMAN.2017.7950370"},{"key":"1022_CR44","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jpdc.2023.02.003","volume":"176","author":"H Zhao","year":"2023","unstructured":"Zhao H, Feng N, Li J, Zhang G, Wang J, Wang Q, Wan B (2023) Vm performance-aware virtual machine migration method based on ant colony optimization in cloud environment. Journal of Parallel and Distributed Computing 176:17\u201327","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"1022_CR45","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/TNET.2017.2781200","volume":"26","author":"R Zhou","year":"2018","unstructured":"Zhou R, Li Z, Wu C (2018) Scheduling frameworks for cloud container services. IEEE\/ACM Trans Networking 26:436\u2013450","journal-title":"IEEE\/ACM Trans Networking"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01022-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-026-01022-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01022-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T14:03:32Z","timestamp":1770041012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-026-01022-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,2]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1022"],"URL":"https:\/\/doi.org\/10.1007\/s12351-026-01022-7","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,2]]},"assertion":[{"value":"26 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential Conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"28"}}