{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T13:43:45Z","timestamp":1783777425126,"version":"3.55.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T00:00:00Z","timestamp":1600387200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T00:00:00Z","timestamp":1600387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71701049"],"award-info":[{"award-number":["71701049"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2018J05120"],"award-info":[{"award-number":["2018J05120"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Project Funding for Social Science Research Base in Fujian Province Social Science Planning","award":["FJ2018JDZ024"],"award-info":[{"award-number":["FJ2018JDZ024"]}]},{"name":"Cultivation Plan for Outstanding Young Research Talents of Universities in Fujian Province"},{"name":"Tianjin University and Fuzhou University Cooperation Independent Innovation Fund","award":["TF2020-7"],"award-info":[{"award-number":["TF2020-7"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10878-020-00647-4","type":"journal-article","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T10:06:52Z","timestamp":1600423612000},"page":"1298-1327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A bi-objective decision model and method for the integrated optimization of bus line planning and lane reservation"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6259-4703","authenticated-orcid":false,"given":"Peng","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ling","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ada","family":"Che","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,18]]},"reference":[{"issue":"2","key":"647_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/atr.5670250205","volume":"25","author":"MH Baaj","year":"1991","unstructured":"Baaj MH, Mahmassani HS (1991) An AI-based approach for transit route system planning and design. J Adv Transp 25(2):187\u2013209","journal-title":"J Adv Transp"},{"issue":"10","key":"647_CR2","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1016\/j.trb.2011.07.005","volume":"45","author":"SA Bagloee","year":"2011","unstructured":"Bagloee SA, Ceder AA (2011) Transit-network design methodology for actual-size road networks. Transp Res Part B Methodol 45(10):1787\u20131804","journal-title":"Transp Res Part B Methodol"},{"key":"647_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.trb.2015.03.006","volume":"77","author":"H Cancela","year":"2015","unstructured":"Cancela H, Mauttone A, Urquhart ME (2015) Mathematical programming formulations for transit network design. Transp Res Part B Methodol 77:17\u201337","journal-title":"Transp Res Part B Methodol"},{"issue":"4","key":"647_CR4","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0191-2615(86)90047-0","volume":"20","author":"A Ceder","year":"1986","unstructured":"Ceder A, Wilson NH (1986) Bus network design. Transp Res Part B Methodol 20(4):331\u2013344","journal-title":"Transp Res Part B Methodol"},{"key":"647_CR5","doi-asserted-by":"crossref","unstructured":"Chai S, Liang Q (2020) An improved nsga-ii algorithm for transit network design and frequency setting problem. J Adv Transp 2020","DOI":"10.1155\/2020\/2895320"},{"issue":"1","key":"647_CR6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1080\/03052150210909","volume":"34","author":"P Chakroborty","year":"2002","unstructured":"Chakroborty P, Wivedi T (2002) Optimal route network design for transit systems using genetic algorithms. Eng Optim 34(1):83\u2013100","journal-title":"Eng Optim"},{"issue":"12","key":"647_CR7","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1109\/TSMC.2015.2417509","volume":"45","author":"A Che","year":"2015","unstructured":"Che A, Wu P, Chu F, Zhou M (2015) Improved quantum-inspired evolutionary algorithm for large-size lane reservation. IEEE Trans Syst Man Cybern Syst 45(12):1535\u20131548","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"4\u20135","key":"647_CR8","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1051\/ro\/2015063","volume":"50","author":"J Cheng","year":"2016","unstructured":"Cheng J, Chu F, Chu C, Xia W (2016) Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices. RAIRO\u2014Oper Res 50(4\u20135):715\u2013732","journal-title":"RAIRO\u2014Oper Res"},{"issue":"2","key":"647_CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF00167373","volume":"12","author":"TA Chua","year":"1984","unstructured":"Chua TA (1984) The planning of urban bus routes and frequencies: a survey. Transportation 12(2):147\u2013172","journal-title":"Transportation"},{"issue":"3","key":"647_CR10","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.ejor.2013.08.002","volume":"232","author":"E Demir","year":"2014","unstructured":"Demir E, Bekta\u015f T, Laporte G (2014) The bi-objective pollution-routing problem. Eur J Oper Res 232(3):464\u2013478","journal-title":"Eur J Oper Res"},{"issue":"9","key":"647_CR11","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1016\/j.energy.2009.06.041","volume":"34","author":"M Esmaili","year":"2009","unstructured":"Esmaili M, Shayanfar HA, Amjady N (2009) Multi-objective congestion management incorporating voltage and transient stabilities. Energy 34(9):1401\u20131412","journal-title":"Energy"},{"issue":"3","key":"647_CR12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10732-008-9089-8","volume":"16","author":"L Fan","year":"2010","unstructured":"Fan L, Mumford CL (2010) A metaheuristic approach to the urban transit routing problem. J Heuristics 16(3):353\u2013372","journal-title":"J Heuristics"},{"issue":"2","key":"647_CR13","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/TITS.2011.2171337","volume":"13","author":"Y Fang","year":"2012","unstructured":"Fang Y, Chu F, Mammar S, Zhou M (2012) Optimal lane reservation in transportation network. IEEE Trans Intell Transp Syst 13(2):482\u2013491","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"647_CR14","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.trc.2012.07.004","volume":"26","author":"Y Fang","year":"2013","unstructured":"Fang Y, Chu F, Mammar S, Che A (2013) An optimal algorithm for automated truck freight transportation via lane reservation strategy. Transp Res Part C Emerg Technol 26:170\u2013183","journal-title":"Transp Res Part C Emerg Technol"},{"key":"647_CR15","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.tranpol.2016.08.006","volume":"52","author":"Y Hadas","year":"2016","unstructured":"Hadas Y, Nahum OE (2016) Urban bus network of priority lanes: a combined multi-objective, multi-criteria and group decision-making approach. Transp Policy 52:186\u2013196","journal-title":"Transp Policy"},{"issue":"3","key":"647_CR16","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s12469-019-00211-2","volume":"11","author":"C Iliopoulou","year":"2019","unstructured":"Iliopoulou C, Kepaptsoglou K, Vlahogianni E (2019) Metaheuristics for the transit route network design problem: a review and comparative analysis. Public Transp 11(3):487\u2013521","journal-title":"Public Transp"},{"key":"647_CR17","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.cie.2019.02.025","volume":"130","author":"SB Jha","year":"2019","unstructured":"Jha SB, Jha J, Tiwari MK (2019) A multi-objective meta-heuristic approach for transit network design and frequency setting problem in a bus transit system. Comput Ind Eng 130:166\u2013186","journal-title":"Comput Ind Eng"},{"key":"647_CR18","doi-asserted-by":"crossref","unstructured":"John MP, Mumford CL, Lewis R (2014) An improved multi-objective algorithm for the urban transit routing problem. In: European conference on evolutionary computation in combinatorial optimization. Springer, pp 49\u201360","DOI":"10.1007\/978-3-662-44320-0_5"},{"key":"647_CR19","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.asoc.2014.04.005","volume":"21","author":"PN Kechagiopoulos","year":"2014","unstructured":"Kechagiopoulos PN, Beligiannis GN (2014) Solving the urban transit routing problem using a particle swarm optimization based algorithm. Appl Soft Comput 21:654\u2013676","journal-title":"Appl Soft Comput"},{"issue":"7","key":"647_CR20","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1080\/0305215X.2013.812728","volume":"46","author":"HL Khoo","year":"2014","unstructured":"Khoo HL, Teoh LE, Meng Q (2014) A bi-objective optimization approach for exclusive bus lane selection and scheduling design. Eng Optim 46(7):987\u20131007","journal-title":"Eng Optim"},{"key":"647_CR21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.cor.2014.05.001","volume":"51","author":"F K\u0131l\u0131\u00e7","year":"2014","unstructured":"K\u0131l\u0131\u00e7 F, G\u00f6k M (2014) A demand based route generation algorithm for public transit network design. Comput Oper Res 51:21\u201329","journal-title":"Comput Oper Res"},{"issue":"3","key":"647_CR22","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/TITS.2011.2144974","volume":"12","author":"M Mesbah","year":"2011","unstructured":"Mesbah M, Sarvi M, Currie G (2011a) Optimization of transit priority in the transportation network using a genetic algorithm. IEEE Trans Intell Transp Syst 12(3):908\u2013919","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"2","key":"647_CR23","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.trc.2010.05.020","volume":"19","author":"M Mesbah","year":"2011","unstructured":"Mesbah M, Sarvi M, Ouveysi I, Currie G (2011b) Optimization of transit priority in the transportation network using a decomposition methodology. Transp Res Part C Emerg Technol 19(2):363\u2013373","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"3","key":"647_CR24","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s12469-009-0014-9","volume":"1","author":"M Michaelis","year":"2009","unstructured":"Michaelis M, Sch\u00f6bel A (2009) Integrating line planning, timetabling, and vehicle scheduling: a customer-oriented heuristic. Public Transp 1(3):211","journal-title":"Public Transp"},{"issue":"1","key":"647_CR25","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/s10878-016-0082-0","volume":"36","author":"G Mishra","year":"2018","unstructured":"Mishra G, Mazumdar S, Pal A (2018) Improved algorithms for the evacuation route planning problem. J Comb Optim 36(1):280\u2013306","journal-title":"J Comb Optim"},{"issue":"4","key":"647_CR26","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R Montemanni","year":"2005","unstructured":"Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Optim 10(4):327\u2013343","journal-title":"J Comb Optim"},{"key":"647_CR27","first-page":"283","volume":"8","author":"G Moussa","year":"2014","unstructured":"Moussa G, Owais M (2014) A novel solution methodology for transit route network design problem. Int J Civ Environ Struct Constr Archit Eng 8:283\u2013290","journal-title":"Int J Civ Environ Struct Constr Archit Eng"},{"key":"647_CR28","doi-asserted-by":"crossref","unstructured":"Mumford CL (2013) New heuristic and evolutionary operators for the multi-objective urban transit routing problem. In: 2013 IEEE congress on evolutionary computation. IEEE, pp 939\u2013946","DOI":"10.1109\/CEC.2013.6557668"},{"issue":"15","key":"647_CR29","doi-asserted-by":"crossref","first-page":"5945","DOI":"10.1016\/j.eswa.2013.05.002","volume":"40","author":"M Nikoli\u0107","year":"2013","unstructured":"Nikoli\u0107 M, Teodorovi\u0107 D (2013) Transit network design by bee colony optimization. Expert Syst Appl 40(15):5945\u20135955","journal-title":"Expert Syst Appl"},{"issue":"3","key":"647_CR30","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s00291-011-0251-6","volume":"34","author":"A Sch\u00f6bel","year":"2012","unstructured":"Sch\u00f6bel A (2012) Line planning in public transportation: models and methods. OR Spectr 34(3):491\u2013510","journal-title":"OR Spectr"},{"key":"647_CR31","unstructured":"Sch\u00f6bel A, Scholl S (2006) Line planning with minimal traveling time. In: 5th Workshop on algorithmic methods and models for optimization of railways (ATMOS\u201905), Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik"},{"issue":"1","key":"647_CR32","doi-asserted-by":"crossref","first-page":"16","DOI":"10.3141\/1623-03","volume":"1623","author":"MC Shih","year":"1998","unstructured":"Shih MC, Mahmassani HS, Baaj MH (1998) Planning and design model for transit route networks with coordinated operations. Transp Res Rec 1623(1):16\u201323","journal-title":"Transp Res Rec"},{"issue":"4","key":"647_CR33","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1287\/trsc.2017.0763","volume":"52","author":"K Steiner","year":"2018","unstructured":"Steiner K, Irnich S (2018) Schedule-based integrated intercity bus line planning via branch-and-cut. Transp Sci 52(4):882\u2013897","journal-title":"Transp Sci"},{"issue":"9","key":"647_CR34","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"BM Waxman","year":"1988","unstructured":"Waxman BM (1988) Routing of multipoint connections. IEEE J Sel Areas Commun 6(9):1617\u20131622","journal-title":"IEEE J Sel Areas Commun"},{"key":"647_CR35","doi-asserted-by":"crossref","unstructured":"Wu P (2018) Optimal bus lane reservation with uncertain impact. In: 2018 IEEE 15th international conference on networking. Sensing and control (ICNSC). IEEE, pp 1\u20135","DOI":"10.1109\/ICNSC.2018.8361323"},{"issue":"3","key":"647_CR36","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1109\/TITS.2014.2368594","volume":"16","author":"P Wu","year":"2015","unstructured":"Wu P, Che A, Chu F, Zhou M (2015) An improved exact $$\\epsilon $$-constraint and cut-and-solve combined method for biobjective robust lane reservation. IEEE Trans Intell Transp Syst 16(3):1479\u20131492","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"8","key":"647_CR37","doi-asserted-by":"crossref","first-page":"2028","DOI":"10.1109\/TITS.2016.2631893","volume":"18","author":"P Wu","year":"2017","unstructured":"Wu P, Che A, Chu F, Fang Y (2017) Exact and heuristic algorithms for rapid and station arrival-time guaranteed bus transportation via lane reservation. IEEE Trans Intell Transp Syst 18(8):2028\u20132043","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"647_CR38","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.cie.2017.04.030","volume":"110","author":"P Wu","year":"2017","unstructured":"Wu P, Chu F, Che A, Fang Y (2017) An efficient two-phase exact algorithm for the automated truck freight transportation problem. Comput Ind Eng 110:59\u201366","journal-title":"Comput Ind Eng"},{"issue":"2","key":"647_CR39","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/tee.22805","volume":"14","author":"P Wu","year":"2019","unstructured":"Wu P, Cheng J, Feng C (2019) Resource-constrained emergency scheduling for forest fires with priority areas: An efficient integer-programming approach. IEEJ Trans Electr Electron Eng 14(2):261\u2013270","journal-title":"IEEJ Trans Electr Electron Eng"},{"issue":"6","key":"647_CR40","doi-asserted-by":"crossref","first-page":"2187","DOI":"10.1109\/TSMC.2018.2810114","volume":"50","author":"P Wu","year":"2020","unstructured":"Wu P, Chu F, Che A, Zhao Y (2020) Dual-objective optimization for lane reservation with residual capacity and budget constraints. IEEE Trans Syst Man Cybern Syst 50(6):2187\u20132197","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"647_CR41","doi-asserted-by":"crossref","unstructured":"Wu X, Che A (2020) Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search. Omega, Article ID: 102117","DOI":"10.1016\/j.omega.2019.102117"},{"key":"647_CR42","doi-asserted-by":"crossref","unstructured":"Wu P, Che A, Chu F (2019) A bi-objective model for bus transit network and lane reservation integrated optimization. In: 2019 International conference on industrial engineering and systems management (IESM). IEEE, pp 1\u20136","DOI":"10.1109\/IESM45758.2019.8948119"},{"key":"647_CR43","doi-asserted-by":"crossref","unstructured":"Wu P, Chu F, Che A, Shi Q (2014) A bus lane reservation problem in urban bus transit network. In: 17th International IEEE conference on intelligent transportation systems (ITSC). IEEE, pp 2864\u20132869","DOI":"10.1109\/ITSC.2014.6958149"},{"key":"647_CR44","doi-asserted-by":"crossref","unstructured":"Wu P, Chu F, Fang Y, Yang CH (2018) Optimal lane reservation via new optimization model and heuristic algorithm. 2018 IEEE 15th international conference on networking. Sensing and control (ICNSC). IEEE, pp 1\u20135","DOI":"10.1109\/ICNSC.2018.8361364"},{"key":"647_CR45","doi-asserted-by":"crossref","unstructured":"Xu W, Yuan C, Peng K, Du H (2019) Big data driven urban railway planning: Shenzhen metro case study. J Comb Optim 1\u201323","DOI":"10.1007\/s10878-019-00422-0"},{"issue":"12","key":"647_CR46","doi-asserted-by":"crossref","first-page":"1422","DOI":"10.1061\/(ASCE)TE.1943-5436.0000475","volume":"138","author":"J Yao","year":"2012","unstructured":"Yao J, Shi F, Zhou Z, Qin J (2012) Combinatorial optimization of exclusive bus lanes and bus frequencies in multi-modal transportation network. J Transp Eng 138(12):1422\u20131429","journal-title":"J Transp Eng"},{"key":"647_CR47","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.trc.2013.12.005","volume":"43","author":"B Yao","year":"2014","unstructured":"Yao B, Hu P, Lu X, Gao J, Zhang M (2014) Transit network design based on travel time reliability. Transp Res Part C Emerg Technol 43:233\u2013248","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"11","key":"647_CR48","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY (1971) Finding the $$k$$ shortest loopless paths in a network. Manage Sci 17(11):712\u2013716","journal-title":"Manage Sci"},{"key":"647_CR49","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.trc.2015.02.014","volume":"55","author":"B Yu","year":"2015","unstructured":"Yu B, Kong L, Sun Y, Yao B, Gao Z (2015) A bi-level programming for bus lane network design. Transp Res Part C Emerg Technol 55:310\u2013327","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"7","key":"647_CR50","doi-asserted-by":"crossref","first-page":"3760","DOI":"10.1016\/j.eswa.2014.11.056","volume":"42","author":"H Zhao","year":"2015","unstructured":"Zhao H, Jiang R et al (2015) The memetic algorithm for the optimization of urban transit network. Expert Syst Appl 42(7):3760\u20133773","journal-title":"Expert Syst Appl"},{"issue":"4","key":"647_CR51","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1007\/s11067-019-09448-7","volume":"19","author":"J Zhao","year":"2019","unstructured":"Zhao J, Yu J, Xia X, Ye J, Yuan Y (2019) Exclusive bus lane network design: a perspective from intersection operational dynamics. Netw Spat Econ 19(4):1143\u20131171","journal-title":"Netw Spat Econ"},{"issue":"2","key":"647_CR52","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1109\/TITS.2013.2243836","volume":"14","author":"Z Zhou","year":"2013","unstructured":"Zhou Z, Chu F, Che A, Zhou M (2013) $$\\epsilon $$-constraint and fuzzy logic-based optimization of hazardous material transportation via lane reservation. IEEE Trans Intell Transp Syst 14(2):847\u2013857","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"647_CR53","doi-asserted-by":"crossref","first-page":"175290","DOI":"10.1109\/ACCESS.2019.2956059","volume":"7","author":"Z Zhou","year":"2019","unstructured":"Zhou Z, Lei W, Wu P, Li B, Fang Y (2019) A new efficient algorithm for hazardous material transportation problem via lane reservation. IEEE Access 7:175290\u2013175301","journal-title":"IEEE Access"},{"issue":"1","key":"647_CR54","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/s10878-018-00377-8","volume":"38","author":"J Zhu","year":"2019","unstructured":"Zhu J, Liu S, Ghosh S (2019) Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update. J Comb Optim 38(1):208\u2013223","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00647-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00647-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00647-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T17:59:33Z","timestamp":1657735173000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00647-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,18]]},"references-count":54,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["647"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00647-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,18]]},"assertion":[{"value":"18 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}