{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T13:40:10Z","timestamp":1759153210967,"version":"3.44.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:00:00Z","timestamp":1750204800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:00:00Z","timestamp":1750204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"AIMS INTL DWC LLC"},{"name":"University of Thessaly Central Library"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We consider branch &amp; price solution algorithms for optimal crew rostering in the context of airline management. Such methodologies employ an optimization model termed <jats:italic>master<\/jats:italic>, which, given a set of pre-constructed rosters (schedules), aims to assign a specific one to each crew member of the group under consideration, so that a suitable aggregate objective expressing the total system cost is minimized. The system cost is typically comprised of the cost related to the activities that remain uncovered plus the roster quality cost. Driven by the requirement that the number of crew members assigned to each activity must always match the corresponding crew complement, the master problem is typically formulated as a set-partition optimization model. We propose its alternative formulation as a set-cover optimization model, in which activity over-coverage is allowed, while roster quality is entirely ignored. This modeling choice expedites significantly the identification of the attainable duty coverage, which is of utter importance to airline practitioners. This is due to the superior computational behavior that the set-cover model exhibits compared to the set-partition one, combined with the fact that the suppression of the roster quality cost reduces significantly the computational effort involved. To transform the optimal set-cover solution into an equivalent set-partition one, we develop a mixed integer optimization model which removes suitably overcovered activities from the final rosters, so as to reach a solution that maximizes roster quality without affecting optimal coverage. The key property that removing activities from a legal and feasible crew roster cannot negate its legality nor its feasibility justifies the correctness of this approach. We report computational results on realistic problem instances demonstrating the behavior of the proposed methodology, assessing its computational performance, and highlighting the specific conditions under which it is preferable than the default one.<\/jats:p>","DOI":"10.1007\/s12351-025-00950-0","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:58:52Z","timestamp":1750240732000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Set-cover master problem formulations for maximum flight coverage in branch &amp; price solution algorithms for optimal aircrew rostering"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4325-2975","authenticated-orcid":false,"given":"George","family":"Kozanidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Odysseas","family":"Moschopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"950_CR1","first-page":"2440","volume":"711","author":"H Achour","year":"2003","unstructured":"Achour H, Gamache M, Soumis F (2003) Branch and cut at the subproblem level in a column generation approach: application to the airline industry. Les Cahiers Du GERAD ISSN 711:2440","journal-title":"Les Cahiers Du GERAD ISSN"},{"issue":"3","key":"950_CR2","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1287\/trsc.1060.0172","volume":"41","author":"H Achour","year":"2007","unstructured":"Achour H, Gamache M, Soumis F, Desaulniers G (2007) An exact solution approach for the preferential bidding system problem in the airline industry. Transp Sci 41(3):354\u2013365. https:\/\/doi.org\/10.1287\/trsc.1060.0172","journal-title":"Transp Sci"},{"key":"950_CR3","unstructured":"AIMS INTL DWC-LLC (2025). Airline solutions package and aviation software. http:\/\/www.aimsairlinesoftware.com\/ Last accessed on April 18, 2025."},{"issue":"3","key":"950_CR4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MW, Vance PH (1998) Branch-and-price: column generation for solving huge integer programs. Oper Res 46(3):316\u2013329. https:\/\/doi.org\/10.1287\/opre.46.3.316","journal-title":"Oper Res"},{"key":"950_CR5","doi-asserted-by":"publisher","unstructured":"Barnhart, C., Cohn, A.M., Johnson, E.L., Klabjan, D., Nemhauser, G.L., Vance, P.H. (2003). Airline crew scheduling. In: Hall, R.W. (ed) Handbook of Transportation Science, 2nd ed. Kluwer Academic Publishers, Norwell, MA, 517\u2013560. https:\/\/doi.org\/10.1007\/978-1-4615-5203-1","DOI":"10.1007\/978-1-4615-5203-1"},{"issue":"1","key":"950_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"JE Beasley","year":"1987","unstructured":"Beasley JE (1987) An algorithm for set covering problem. Eur J Oper Res 31(1):85\u201393. https:\/\/doi.org\/10.1016\/0377-2217(87)90141-X","journal-title":"Eur J Oper Res"},{"issue":"4","key":"950_CR7","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1016\/j.disopt.2008.06.001","volume":"5","author":"MA Boschetti","year":"2008","unstructured":"Boschetti MA, Mingozzi A, Ricciardelli S (2008) A dual ascent procedure for the set partitioning problem. Discret Optim 5(4):735\u2013747. https:\/\/doi.org\/10.1016\/j.disopt.2008.06.001","journal-title":"Discret Optim"},{"issue":"1","key":"950_CR8","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.trb.2009.06.003","volume":"44","author":"K Boubaker","year":"2010","unstructured":"Boubaker K, Desaulniers G, Elhallaoui I (2010) Bidline scheduling with equity by heuristic dynamic constraint aggregation. Transport Res b: Method 44(1):50\u201361. https:\/\/doi.org\/10.1016\/j.trb.2009.06.003","journal-title":"Transport Res b: Method"},{"issue":"2","key":"950_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/opre.45.2.295","volume":"45","author":"J Bramel","year":"1997","unstructured":"Bramel J, Simchi-Levi D (1997) On the effectiveness of set covering formulations for the vehicle routing problem with time windows. Oper Res 45(2):295\u2013301. https:\/\/doi.org\/10.1287\/opre.45.2.295","journal-title":"Oper Res"},{"key":"950_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515.ch4","volume-title":"Set-covering-based algorithms for the capacitated VRP","author":"J Bramel","year":"2002","unstructured":"Bramel J, Simchi-Levi D (2002) Set-covering-based algorithms for the capacitated VRP. Society for Industrial and Applied Mathematics, The vehicle routing problem. https:\/\/doi.org\/10.1137\/1.9780898718515.ch4"},{"issue":"1","key":"950_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.23.1.1","volume":"23","author":"M Desrochers","year":"1989","unstructured":"Desrochers M, Soumis F (1989) A column generation approach to the urban transit crew scheduling problem. Transp Sci 23(1):1\u201313. https:\/\/doi.org\/10.1287\/trsc.23.1.1","journal-title":"Transp Sci"},{"issue":"2","key":"950_CR12","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40(2):342\u2013354. https:\/\/doi.org\/10.1287\/opre.40.2.342","journal-title":"Oper Res"},{"key":"950_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O du Merle","year":"1999","unstructured":"du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math 194:229\u2013237. https:\/\/doi.org\/10.1016\/S0012-365X(98)00213-1","journal-title":"Discrete Math"},{"key":"950_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s12469-011-0038-9","volume":"3","author":"V D\u00fcck","year":"2011","unstructured":"D\u00fcck V, Wesselmann F, Suhl L (2011) Implementing a branch and price and cut method for the airline crew pairing optimization problem. Public Transp 3:43\u201364. https:\/\/doi.org\/10.1007\/s12469-011-0038-9","journal-title":"Public Transp"},{"issue":"2","key":"950_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0305-0483(90)90066-I","volume":"18","author":"E El-Darzi","year":"1990","unstructured":"El-Darzi E, Mitra G (1990) Set covering and set partitioning: a collection of test problems. Omega 18(2):195\u2013201. https:\/\/doi.org\/10.1016\/0305-0483(90)90066-I","journal-title":"Omega"},{"issue":"6","key":"950_CR16","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"ML Fisher","year":"1990","unstructured":"Fisher ML, Kedia P (1990) Optimal solution of set covering\/partitioning problems using dual heuristics. Manage Sci 36(6):674\u2013688. https:\/\/doi.org\/10.1287\/mnsc.36.6.674","journal-title":"Manage Sci"},{"key":"950_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10479-008-0379-1","volume":"171","author":"S Gabteni","year":"2009","unstructured":"Gabteni S, Gr\u00f6nkvist M (2009) Combining column generation and constraint programming to solve the tail assignment problem. Ann Oper Res 171:61\u201376. https:\/\/doi.org\/10.1007\/s10479-008-0379-1","journal-title":"Ann Oper Res"},{"key":"950_CR18","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1287\/trsc.32.3.246","volume":"32","author":"M Gamache","year":"1998","unstructured":"Gamache M, Soumis F, Desrosiers J, Villeneuve D, G\u00e9linas E (1998) The preferential bidding system at Air Canada. Transp Sci 32:246\u2013255. https:\/\/doi.org\/10.1287\/trsc.32.3.246","journal-title":"Transp Sci"},{"issue":"2","key":"950_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1287\/opre.47.2.247","volume":"47","author":"M Gamache","year":"1999","unstructured":"Gamache M, Soumis F, Marquis G, Desrosiers J (1999) A column generation approach for large-scale aircrew rostering problems. Oper Res 47(2):247\u2013263. https:\/\/doi.org\/10.1287\/opre.47.2.247","journal-title":"Oper Res"},{"issue":"8","key":"950_CR20","doi-asserted-by":"publisher","first-page":"2384","DOI":"10.1016\/j.cor.2005.09.010","volume":"34","author":"M Gamache","year":"2007","unstructured":"Gamache M, Hertz A, Ouellet JO (2007) A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding. Comp Oper Res 34(8):2384\u20132395. https:\/\/doi.org\/10.1016\/j.cor.2005.09.010","journal-title":"Comp Oper Res"},{"key":"950_CR21","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10479-005-3975-3","volume":"140","author":"B Gopalakrishnan","year":"2005","unstructured":"Gopalakrishnan B, Johnson EL (2005) Airline crew scheduling: State-of-the-art. Ann Oper Res 140:305\u2013337. https:\/\/doi.org\/10.1007\/s10479-005-3975-3","journal-title":"Ann Oper Res"},{"key":"950_CR22","unstructured":"IBM ILOG CPLEX Optimization Studio v. 22.1.1 (2022). https:\/\/www.ibm.com\/docs\/en\/icos\/22.1.1. Last accessed on April 18, 2025"},{"key":"950_CR23","doi-asserted-by":"publisher","unstructured":"Kallehauge B, Larsen J, Madsen OB, Solomon MM (2005) Vehicle routing problem with time windows. In: Desaulniers G, Desrosiers J, Solomon MM (eds) Column Generation. Springer, Boston, MA, USA. https:\/\/doi.org\/10.1007\/0-387-25486-2_3","DOI":"10.1007\/0-387-25486-2_3"},{"key":"950_CR24","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1080\/10556788.2015.1025134","volume":"30","author":"H Karimi","year":"2015","unstructured":"Karimi H, Seifi A (2015) Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem. Optim Methods Softw 30:1109\u20131125. https:\/\/doi.org\/10.1080\/10556788.2015.1025134","journal-title":"Optim Methods Softw"},{"issue":"2","key":"950_CR25","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s13676-015-0080-x","volume":"6","author":"A Kasirzadeh","year":"2017","unstructured":"Kasirzadeh A, Saddoune M, Soumis F (2017) Airline crew scheduling: models, algorithms, and data sets. EURO J Transp Logist 6(2):111\u2013137. https:\/\/doi.org\/10.1007\/s13676-015-0080-x","journal-title":"EURO J Transp Logist"},{"issue":"1\u20134","key":"950_CR26","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:ANOR.0000019091.54417.ca","volume":"127","author":"N Kohl","year":"2004","unstructured":"Kohl N, Karisch SE (2004) Airline crew rostering: Problem types, modeling, and optimization. Ann Oper Res 127(1\u20134):223\u2013257. https:\/\/doi.org\/10.1023\/B:ANOR.0000019091.54417.ca","journal-title":"Ann Oper Res"},{"key":"950_CR27","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jairtraman.2016.11.012","volume":"59","author":"G Kozanidis","year":"2017","unstructured":"Kozanidis G (2017) Optimal assignment of aircrew trainees to simulator and classroom training sessions subject to seniority and preference restrictions. J Air Transp Manag 59:143\u2013154. https:\/\/doi.org\/10.1016\/j.jairtraman.2016.11.012","journal-title":"J Air Transp Manag"},{"issue":"2","key":"950_CR28","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1080\/10556788.2017.1281923","volume":"33","author":"G Kozanidis","year":"2018","unstructured":"Kozanidis G (2018a) Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft. Optim Methods Softw 33(2):221\u2013248. https:\/\/doi.org\/10.1080\/10556788.2017.1281923","journal-title":"Optim Methods Softw"},{"key":"950_CR29","unstructured":"Kozanidis G, Moschopoulos O (2023) Set-cover master problem formulations in branch & price solution methodologies for optimal aircrew scheduling. Lecture Notes in Operations Research, Proceedings of the Annual International Conference of the German Operations Research Society, Hamburg, Germany, August 29 - September 1, 6 pages. https:\/\/link.springer.com\/book\/9783031584046"},{"key":"950_CR30","doi-asserted-by":"publisher","unstructured":"Kozanidis G (2018b) Column generation for optimal shipment delivery in a logistic distribution network. In: Cinar D, Gakis K, Pardalos PM (eds.), Sustainable Logistics and Transportation, Springer Optimization and Its Applications, Vol. 129, Ch. 5, Springer-Verlag, Berlin, 87\u2013112. https:\/\/doi.org\/10.1007\/978-3-319-69215-9_5","DOI":"10.1007\/978-3-319-69215-9_5"},{"issue":"1","key":"950_CR31","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0377-2217(88)90377-3","volume":"35","author":"S Lavoie","year":"1988","unstructured":"Lavoie S, Minoux M, Odier E (1988) A new approach for crew pairing problems by column generation with an application to air transportation. Eur J Oper Res 35(1):45\u201358. https:\/\/doi.org\/10.1016\/0377-2217(88)90377-3","journal-title":"Eur J Oper Res"},{"issue":"6","key":"950_CR32","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper Res 53(6):1007\u20131023. https:\/\/doi.org\/10.1287\/opre.1050.0234","journal-title":"Oper Res"},{"key":"950_CR33","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1016\/j.cor.2006.09.001","volume":"35","author":"M Mesquita","year":"2008","unstructured":"Mesquita M, Paias A (2008) Set partitioning\/covering-based approaches for the integrated vehicle and crew scheduling problem. Comp Oper Res 35:1562\u20131575. https:\/\/doi.org\/10.1016\/j.cor.2006.09.001","journal-title":"Comp Oper Res"},{"issue":"6","key":"950_CR34","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1287\/opre.47.6.873","volume":"47","author":"A Mingozzi","year":"1999","unstructured":"Mingozzi A, Boschetti MA, Ricciardelli S, Bianco L (1999) A set partitioning approach to the crew scheduling problem. Oper Res 47(6):873\u2013888. https:\/\/doi.org\/10.1287\/opre.47.6.873","journal-title":"Oper Res"},{"key":"950_CR35","unstructured":"Moschopoulos O, Kaimakamis K, Kozanidis G (2018) Set-partition versus set-cover formulations for column generation-based solution methodologies for optimal airline crew scheduling. In: 7th International Symposium & 29th National Conference of the Hellenic Operational Research Society, ISBN: 978\u2013618\u201380361\u20137\u20138, Chania, Crete, Greece, June 14\u201316, 30\u201334"},{"issue":"2","key":"950_CR36","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/ijoc.2017.0784","volume":"30","author":"A Pessoa","year":"2018","unstructured":"Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2018) Automation and combination of linear-programming based stabilization techniques in column generation. INFORMS J Comput 30(2):339\u2013360. https:\/\/doi.org\/10.1287\/ijoc.2017.0784","journal-title":"INFORMS J Comput"},{"key":"950_CR37","doi-asserted-by":"publisher","unstructured":"Shen, Y., Sun, Y., Li, X., Cao, Z., Eberhard, A., Zhang, G. (2024). Adaptive stabilization based on machine learning for column generation. arXiv preprint arXiv: 2405.11198. https:\/\/doi.org\/10.48550\/arXiv.2405.11198","DOI":"10.48550\/arXiv.2405.11198"},{"issue":"2","key":"950_CR38","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0191-2607(88)90022-2","volume":"22","author":"BM Smith","year":"1988","unstructured":"Smith BM, Wren A (1988) A bus crew scheduling system using a set covering formulation. Transp Res Part a: General 22(2):97\u2013108. https:\/\/doi.org\/10.1016\/0191-2607(88)90022-2","journal-title":"Transp Res Part a: General"},{"issue":"6","key":"950_CR39","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/opre.47.6.862","volume":"47","author":"JM van den Akker","year":"1999","unstructured":"van den Akker JM, Hoogeveen JA, van den Velde SL (1999) Parallel machine scheduling by column generation. Oper Res 47(6):862\u2013872. https:\/\/doi.org\/10.1287\/opre.47.6.862","journal-title":"Oper Res"},{"key":"950_CR40","doi-asserted-by":"publisher","unstructured":"Vanderbeck F (2005) Implementing mixed integer column generation, Ch. 12 in Column Generation: G. Desaulniers, J. Desrosiers, and M.M. Solomon, eds., Springer, Berlin, 2005, pp 331\u2013358. https:\/\/doi.org\/10.1007\/0-387-25486-2_12","DOI":"10.1007\/0-387-25486-2_12"},{"key":"950_CR41","doi-asserted-by":"publisher","unstructured":"Vemuganti RR (1998) Applications of set covering, set packing and set partitioning models: A survey. In: Du DZ, Pardalos PM (eds) Handbook of Combinatorial Optimization. Springer, Boston, MA. https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_9","DOI":"10.1007\/978-1-4613-0303-9_9"},{"key":"950_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.jairtraman.2022.102270","volume":"105","author":"X Wen","year":"2022","unstructured":"Wen X, Sun X, Ma HL, Sun Y (2022) A column generation approach for operational flight scheduling and aircraft maintenance routing. J Air Transp Manag 105:102270. https:\/\/doi.org\/10.1016\/j.jairtraman.2022.102270","journal-title":"J Air Transp Manag"},{"key":"950_CR43","volume-title":"Model building in mathematical programming","author":"HP Williams","year":"2013","unstructured":"Williams HP (2013) Model building in mathematical programming. John Wiley & Sons"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00950-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-025-00950-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00950-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T13:07:40Z","timestamp":1759151260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-025-00950-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,18]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["950"],"URL":"https:\/\/doi.org\/10.1007\/s12351-025-00950-0","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2025,6,18]]},"assertion":[{"value":"1 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"69"}}