{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:23:17Z","timestamp":1742977397742,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031834370"},{"type":"electronic","value":"9783031834387"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-83438-7_28","type":"book-chapter","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:33Z","timestamp":1738706193000},"page":"331-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The MASEMPR Problem and\u00a0Its Applications in\u00a0Logistics"],"prefix":"10.1007","author":[{"given":"A.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Wojciechowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sangram K.","family":"Jena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"key":"28_CR1","first-page":"673","volume":"7","author":"MO Ball","year":"1995","unstructured":"Ball, M.O., Colbourn, C.J., Provan, J.S.: Network reliability. Handb. Oper. Res. Manag. Sci. 7, 673\u2013762 (1995)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1007\/s00453-010-9389-x","volume":"60","author":"Z-Z Chen","year":"2011","unstructured":"Chen, Z.-Z., Lin, G., Wang, L.: An approximation algorithm for the minimum co-path set problem. Algorithmica 60(4), 969\u2013986 (2011)","journal-title":"Algorithmica"},{"key":"28_CR3","unstructured":"Cheng, Y., Cai, Z., Goebel, R., Lin, G., Zhu, B.: The radiation hybrid map construction problem: recognition, hardness, and approximation algorithms (2008)"},{"issue":"4978","key":"28_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1126\/science.2218528","volume":"250","author":"DR Cox","year":"1990","unstructured":"Cox, D.R., Burmeister, M., Price, E.R., Kim, S., Myers, R.M.: Radiation hybrid mapping: a somatic cell genetic method for constructing high-resolution maps of mammalian chromosomes. Science 250(4978), 245\u2013250 (1990)","journal-title":"Science"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Feng, Q., Zhou, Q., Li, S.: Randomized parameterized algorithms for co-path set problem. In: International Workshop on Frontiers in Algorithmics, pp. 82\u201393 (2014)","DOI":"10.1007\/978-3-319-08016-1_8"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms, 1st edn. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-16533-7_1"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Boston, Massachusetts, USA, 25\u201327 April 1983, pp. 448\u2013456. ACM (1983)","DOI":"10.1145\/800061.808776"},{"issue":"2","key":"28_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/atr.5670330210","volume":"33","author":"MAP Taylor","year":"1999","unstructured":"Taylor, M.A.P.: Dense network traffic models, travel time reliability and traffic management. II: application to network reliability. J. Adv. Transport. 33(2), 235\u2013251 (1999)","journal-title":"J. Adv. Transport."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83438-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:36Z","timestamp":1738706196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83438-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031834370","9783031834387"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83438-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Coimbatore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam-2025-website.vercel.app\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}