{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T10:48:13Z","timestamp":1768819693259,"version":"3.49.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T00:00:00Z","timestamp":1631145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T00:00:00Z","timestamp":1631145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10732-021-09478-w","type":"journal-article","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T10:04:21Z","timestamp":1631181861000},"page":"1081-1110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Randomized rounding algorithms for large scale unsplittable flow problems"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1332-9206","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Lamothe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8559-1617","authenticated-orcid":false,"given":"Emmanuel","family":"Rachelson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5918-0753","authenticated-orcid":false,"given":"Alain","family":"Ha\u00eft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cedric","family":"Baudoin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Baptiste","family":"Dup\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"key":"9478_CR1","unstructured":"Alvelos, F., Val\u00e9rio\u00a0de Carvalho, J.: A local search heuristic based on column generation applied to the binary multicommodity flow problem. In: Proceedings of International Network Optimization Conference, INOC, Citeseer, p.\u00a06 (2007)"},{"key":"9478_CR2","unstructured":"Alvelos, F., De\u00a0Carvalho, J.V.: Comparing branch-and-price algorithms for the unsplittable multicommodity flow problem. In: International Network Optimization Conference, pp. 7\u201312 (2003)"},{"issue":"4","key":"9478_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF02022997","volume":"41","author":"CA Anderson","year":"1993","unstructured":"Anderson, C.A., Fraughnaugh, K., Parker, M., Ryan, J.: Path assignment for call routing: an application of Tabu search. Ann. Oper. Res. 41(4), 299\u2013312 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"9478_CR4","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s00493-010-2455-9","volume":"30","author":"M Andrews","year":"2010","unstructured":"Andrews, M., Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K., Zhang, L.: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Combinatorica 30(5), 485\u2013520 (2010)","journal-title":"Combinatorica"},{"key":"9478_CR5","unstructured":"Asano, Y.: Experimental evaluation of approximation algorithms for the minimum cost multiple-source unsplittable flow problem. In: ICALP Satellite Workshops, pp. 111\u2013122 (2000)"},{"key":"9478_CR6","unstructured":"Aumann, Y., Rabani, Y.: Improved bounds for all optical routing. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, Citeseer, pp. 567\u2013576 (1995)"},{"issue":"1","key":"9478_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00453-005-1172-z","volume":"44","author":"Y Azar","year":"2006","unstructured":"Azar, Y., Regev, O.: Combinatorial algorithms for the unsplittable flow problem. Algorithmica 44(1), 49\u201366 (2006)","journal-title":"Algorithmica"},{"issue":"1","key":"9478_CR8","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1287\/opre.1050.0262","volume":"54","author":"F Babonneau","year":"2006","unstructured":"Babonneau, F., Du Merle, O., Vial, J.P.: Solving large-scale linear multicommodity flow problems with an active set strategy and proximal-ACCPM. Oper. Res. 54(1), 184\u2013197 (2006)","journal-title":"Oper. Res."},{"issue":"2","key":"9478_CR9","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C Barnhart","year":"2000","unstructured":"Barnhart, C., Hane, C.A., Vance, P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2), 318\u2013326 (2000)","journal-title":"Oper. Res."},{"key":"9478_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.endm.2013.05.107","volume":"41","author":"PO Bauguion","year":"2013","unstructured":"Bauguion, P.O., Ben-Ameur, W., Gourdin, E.: A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source maximum concurrent flow. Electron. Notes Discrete Math. 41, 311\u2013318 (2013)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"9478_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/net.21572","volume":"65","author":"PO Bauguion","year":"2015","unstructured":"Bauguion, P.O., Ben-Ameur, W., Gourdin, E.: Efficient algorithms for the maximum concurrent flow problem. Networks 65(1), 56\u201367 (2015)","journal-title":"Networks"},{"issue":"3","key":"9478_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1051\/ro:2007023","volume":"41","author":"M Belaidouni","year":"2007","unstructured":"Belaidouni, M., Ben-Ameur, W.: On the minimum cost multiple-source unsplittable flow problem. RAIRO-Oper. Res. 41(3), 253\u2013273 (2007)","journal-title":"RAIRO-Oper. Res."},{"issue":"1","key":"9478_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/net.20483","volume":"59","author":"J Castro","year":"2012","unstructured":"Castro, J., Cuesta, J.: Improving an interior-point algorithm for multicommodity flows by quadratic regularizations. Networks 59(1), 117\u2013131 (2012)","journal-title":"Networks"},{"issue":"1","key":"9478_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00453-006-1210-5","volume":"47","author":"A Chakrabarti","year":"2007","unstructured":"Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. Algorithmica 47(1), 53\u201378 (2007)","journal-title":"Algorithmica"},{"key":"9478_CR15","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K.: Hardness of routing with congestion in directed graphs. In: Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing, ACM, pp. 165\u2013178 (2007)","DOI":"10.1145\/1250790.1250816"},{"key":"9478_CR16","unstructured":"Coudert, D., Rivano, H.: Lightpath assignment for multifibers wdm networks with wavelength translators. In: Global Telecommunications Conference, 2002. GLOBECOM \u201902. IEEE, vol.\u00a03, pp. 2686\u20132690 (2002)"},{"key":"9478_CR17","unstructured":"Cox, L.A.: Dynamic anticipatory routing of circuit-switched telecommunications networks. Hand-book of Genetic Algorithms (1991)"},{"issue":"5","key":"9478_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0167-6377(86)90013-1","volume":"5","author":"J Csirik","year":"1986","unstructured":"Csirik, J., Galambos, G., Frenk, H.J., Frieze, A., Kan, R., Alexander, A.: A probabilistic analysis of the next fit decreasing bin packing heuristic. Oper. Res. Lett. 5(5), 233\u2013236 (1986)","journal-title":"Oper. Res. Lett."},{"key":"9478_CR19","doi-asserted-by":"crossref","unstructured":"Dai, W., Sun, X., Wandelt, S.: Finding feasible solutions for multi-commodity flow problems. In: 2016 35th Chinese Control Conference (CCC), IEEE, pp. 2878\u20132883 (2016a)","DOI":"10.1109\/ChiCC.2016.7553801"},{"key":"9478_CR20","first-page":"1989","volume":"2016","author":"W Dai","year":"2016","unstructured":"Dai, W., Zhang, J., Sun, X., Wandelt, S.: Node dependency in multi-commodity flow problem with applications to transportation networks. CICTP 2016, 1989\u20132001 (2016b)","journal-title":"CICTP"},{"issue":"4","key":"9478_CR21","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/j.cja.2017.05.012","volume":"30","author":"W Dai","year":"2017","unstructured":"Dai, W., Zhang, J., Sun, X.: On solving multi-commodity flow problems: an experimental evaluation. Chin. J. Aeronaut. 30(4), 1481\u20131492 (2017)","journal-title":"Chin. J. Aeronaut."},{"key":"9478_CR22","unstructured":"Emanuelsson, K.: Approximating multi-commodity max-flow in practice (2016)"},{"issue":"4","key":"9478_CR23","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0895480199355754","volume":"13","author":"LK Fleischer","year":"2000","unstructured":"Fleischer, L.K.: Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discrete Math. 13(4), 505\u2013520 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"9478_CR24","unstructured":"Ford, L.R., Jr.: Network flow theory. Tech. rep, Rand Corp Santa Monica Ca (1956)"},{"issue":"1\u20132","key":"9478_CR25","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10107-014-0779-8","volume":"152","author":"J Gondzio","year":"2015","unstructured":"Gondzio, J., Gonz\u00e1lez-Brevis, P.: A new warmstarting strategy for the primal-dual column generation method. Math. Program. 152(1\u20132), 113\u2013146 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"9478_CR26","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ejor.2012.07.024","volume":"224","author":"J Gondzio","year":"2013","unstructured":"Gondzio, J., Gonz\u00e1lez-Brevis, P., Munari, P.: New developments in the primal-dual column generation technique. Eur. J. Oper. Res. 224(1), 41\u201351 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9478_CR27","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s12532-015-0090-6","volume":"8","author":"J Gondzio","year":"2016","unstructured":"Gondzio, J., Gonz\u00e1lez-Brevis, P., Munari, P.: Large-scale optimization with the primal-dual column generation method. Math. Progr. Comput. 8(1), 47\u201382 (2016)","journal-title":"Math. Progr. Comput."},{"key":"9478_CR28","unstructured":"Group, T.F., Gonzalez, T.: Handbook of Approximation Algorithms and Metaheuristics, Second Edition: Two-Volume Set. Taylor & Francis Group (2020). https:\/\/books.google.fr\/books?id=iD2UzQEACAAJ"},{"key":"9478_CR29","unstructured":"Gurobi\u00a0Optimization, L.: Gurobi optimizer reference manual (2020). http:\/\/www.gurobi.com"},{"key":"9478_CR30","doi-asserted-by":"crossref","unstructured":"Jim\u00e9nez, V.M., Marzal, A.: Computing the k shortest paths: a new algorithm and an experimental comparison. In: International Workshop on Algorithm Engineering, Springer, pp. 15\u201329 (1999)","DOI":"10.1007\/3-540-48318-7_4"},{"issue":"3","key":"9478_CR31","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0020-0190(03)00351-X","volume":"88","author":"P Kolman","year":"2003","unstructured":"Kolman, P.: A note on the greedy algorithm for the unsplittable flow problem. Inf. Process. Lett. 88(3), 101\u2013105 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9478_CR32","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/mnsc.39.4.492","volume":"39","author":"M Laguna","year":"1993","unstructured":"Laguna, M., Glover, F.: Bandwidth packing: a Tabu search approach. Manag. Sci. 39(4), 492\u2013500 (1993)","journal-title":"Manag. Sci."},{"issue":"9","key":"9478_CR33","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1057\/jors.2009.86","volume":"61","author":"X Li","year":"2010","unstructured":"Li, X., Aneja, Y.P., Baki, F.: An ant colony optimization metaheuristic for single-path multicommodity network flow problems. J. Oper. Res. Soc. 61(9), 1340\u20131355 (2010)","journal-title":"J. Oper. Res. Soc."},{"key":"9478_CR34","doi-asserted-by":"crossref","unstructured":"Madry, A.: Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms. In: Proceedings of the Forty-second ACM Symposium on Theory of computing, ACM, pp 121\u2013130 (2010)","DOI":"10.1145\/1806689.1806708"},{"issue":"2","key":"9478_CR35","first-page":"68","volume":"48","author":"M Martens","year":"2006","unstructured":"Martens, M., Skutella, M.: Flows on few paths: algorithms and lower bounds. Netw. Int. J. 48(2), 68\u201376 (2006)","journal-title":"Netw. Int. J."},{"key":"9478_CR36","doi-asserted-by":"crossref","unstructured":"Masri, H., Krichen, S., Guitouni, A.: An ant colony optimization metaheuristic for solving bi-objective multi-sources multicommodity communication flow problem. In: 2011 4th Joint IFIP Wireless and Mobile Networking Conference (WMNC 2011). IEEE, pp. 1\u20138 (2011)","DOI":"10.1109\/WMNC.2011.6097256"},{"key":"9478_CR37","first-page":"132","volume":"251","author":"H Masri","year":"2015","unstructured":"Masri, H., Krichen, S., Guitouni, A.: A multi-start variable neighborhood search for solving the single path multicommodity flow problem. Appl. Math. Comput. 251, 132\u2013142 (2015)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"9478_CR38","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1111\/itor.12378","volume":"26","author":"H Masri","year":"2019","unstructured":"Masri, H., Krichen, S., Guitouni, A.: Metaheuristics for solving the biobjective single-path multicommodity communication flow problem. Int. Trans. Oper. Res. 26(2), 589\u2013614 (2019)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"9478_CR39","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ejor.2015.01.021","volume":"244","author":"S Moradi","year":"2015","unstructured":"Moradi, S., Raith, A., Ehrgott, M.: A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem. Eur. J. Oper. Res. 244(2), 369\u2013378 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"9478_CR40","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1287\/mnsc.42.9.1277","volume":"42","author":"K Park","year":"1996","unstructured":"Park, K., Kang, S., Park, S.: An integer programming approach to the bandwidth packing problem. Manag. Sci. 42(9), 1277\u20131291 (1996)","journal-title":"Manag. Sci."},{"key":"9478_CR41","unstructured":"Park, S., Kim, D., Lee, K.: An integer programming approach to the path selection problems. In: Proceedings of the International Network Optimization Conference INOC, Evry-Paris, France, pp. 448\u2013453 (2003)"},{"issue":"1","key":"9478_CR42","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF02109857","volume":"2","author":"M Parker","year":"1993","unstructured":"Parker, M., Ryan, J.: A column generation algorithm for bandwidth packing. Telecommun. Syst. 2(1), 185\u2013195 (1993)","journal-title":"Telecommun. Syst."},{"issue":"2","key":"9478_CR43","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P Raghavan","year":"1988","unstructured":"Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. Syst. Sci. 37(2), 130\u2013143 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"9478_CR44","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P Raghavan","year":"1987","unstructured":"Raghavan, P., Tompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"9478_CR45","doi-asserted-by":"crossref","unstructured":"Retvdri, G., B\u00edr\u00f3, J.J., Cinkler, T.: A novel lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to ospf traffic engineering. In: Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No. 04TH8769), IEEE, vol.\u00a02, pp. 957\u2013962 (2004)","DOI":"10.1109\/ISCC.2004.1358664"},{"key":"9478_CR46","doi-asserted-by":"crossref","unstructured":"Santos, D., de\u00a0Sousa, A., Alvelos, F., Pioro, M.: Link load balancing optimization of telecommunication networks: A column generation based heuristic approach. In: 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). IEEE, pp. 1\u20136 (2010)","DOI":"10.1109\/NETWKS.2010.5624911"},{"issue":"12","key":"9478_CR47","doi-asserted-by":"publisher","first-page":"3147","DOI":"10.1016\/j.cor.2013.05.006","volume":"40","author":"D Santos","year":"2013","unstructured":"Santos, D., De Sousa, A., Alvelos, F.: A hybrid column generation with grasp and path relinking for the network load balancing problem. Comput. Oper. Res. 40(12), 3147\u20133158 (2013a)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9478_CR48","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s11235-011-9604-3","volume":"52","author":"D Santos","year":"2013","unstructured":"Santos, D., de Sousa, A., Alvelos, F., Pi\u00f3ro, M.: Optimizing network load balancing: an hybridization approach of metaheuristics with column generation. Telecommun. Syst. 52(2), 959\u2013968 (2013b)","journal-title":"Telecommun. Syst."},{"issue":"2","key":"9478_CR49","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"F Shahrokhi","year":"1990","unstructured":"Shahrokhi, F., Matula, D.W.: The maximum concurrent flow problem. J. ACM 37(2), 318\u2013334 (1990)","journal-title":"J. ACM"},{"key":"9478_CR50","unstructured":"Shepherd, F.B., Vetta, A.: The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems (2015). arXiv preprint arXiv:1504.00627"},{"issue":"4","key":"9478_CR51","first-page":"155","volume":"15","author":"IL Wang","year":"2018","unstructured":"Wang, I.L.: Multicommodity network flows: a survey, part II: solution methods. Int. J. Oper. Res. 15(4), 155\u2013173 (2018)","journal-title":"Int. J. Oper. Res."},{"key":"9478_CR52","unstructured":"Wang, Y., Wang, Z.: Explicit routing algorithms for internet traffic engineering. In: Proceedings Eight International Conference on Computer Communications and Networks (Cat. No. 99EX370). IEEE, pp. 582\u2013588 (1999)"},{"issue":"1","key":"9478_CR53","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1023\/A:1019149101850","volume":"8","author":"J Xu","year":"1997","unstructured":"Xu, J., Chiu, S.Y., Glover, F.: Tabu search for dynamic routing communications network design. Telecommun. Syst. 8(1), 55\u201377 (1997)","journal-title":"Telecommun. Syst."},{"issue":"11","key":"9478_CR54","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manag. Sci."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-021-09478-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-021-09478-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-021-09478-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:59:08Z","timestamp":1725764348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-021-09478-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,9]]},"references-count":54,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["9478"],"URL":"https:\/\/doi.org\/10.1007\/s10732-021-09478-w","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,9]]},"assertion":[{"value":"18 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This work was partially funded by Thales Alenia Space and made in collaboration with several of its members. This work was partially funded by the CNES. Several authors are academically related to ISAE-SUPAERO. The authors declare that they have no conflict of interest. The datasets and the code used in the experimental section of this work are accessible at.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}