{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:51:02Z","timestamp":1742953862743,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031207877"},{"type":"electronic","value":"9783031207884"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-20788-4_4","type":"book-chapter","created":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T02:52:16Z","timestamp":1675911136000},"page":"53-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Shortest Path in Signed Graphs"],"prefix":"10.1007","author":[{"given":"In\u00eas Ser\u00f4dio","family":"Costa","sequence":"first","affiliation":[]},{"given":"Rosa","family":"Figueiredo","sequence":"additional","affiliation":[]},{"given":"Cristina","family":"Requejo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,9]]},"reference":[{"key":"4_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Prentice (1993)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D Cartwright","year":"1956","unstructured":"Cartwright, D., Harary, F.: Structural balance: a generalization of Heider\u00e2s theory. Psychol. Rev. 63, 277\u2013293 (1956)","journal-title":"Psychol. Rev."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"DasGupta, B., Enciso, G.A., Sontag, E., Zhang, Y.: Algorithmic and complexity results for decompositions of biological networks into monotone subsystems. In: \u00c0lvarez, C., Serna, M. (eds) Experimental Algorithms, pp. 253\u2013264. Springer, Berlin (2006)","DOI":"10.1007\/11764298_23"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Doreian, P., Mrvar, A.: Structural balance and signed international relations. J. Soc. Struct. 16 (2015)","DOI":"10.21307\/joss-2019-012"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.socnet.2013.09.002","volume":"35","author":"R Figueiredo","year":"2013","unstructured":"Figueiredo, R., Moura, G.: Mixed integer programming formulations for clustering problems related to structural balance. Soc. Netw. 35(4), 639\u2013651 (2013)","journal-title":"Soc. Netw."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Hansen, P.: Shortest paths in signed graphs. In: Burkard, R., Cuninghame-Green, R., Zimmermann, U. (eds) Algebraic and Combinatorial Methods in Operations Research. North-Holland Mathematics Studies, vol. 95, pp. 201\u2013214. North-Holland (1984)","DOI":"10.1016\/S0304-0208(08)72963-3"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1093\/imaman\/13.3.201","volume":"13","author":"F Harary","year":"2002","unstructured":"Harary, F., Lim, M.-H., Wunsch, D.C.: Signed graphs for portfolio analysis in risk management. IMA J. Manag. Math. 13(3), 201\u2013210 (2002)","journal-title":"IMA J. Manag. Math."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/00223980.1946.9917275","volume":"21","author":"F Heider","year":"1946","unstructured":"Heider, F.: Attitudes and cognitive organization. J. Psychol. 21, 107\u2013112 (1946)","journal-title":"J. Psychol."},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1186\/1471-2105-10-181","volume":"10","author":"S Klamt","year":"2009","unstructured":"Klamt, S., von Kamp, A.: Computing paths and cycles in biological interaction graphs. BMC Bioinf. 10(1), 181\u2013192 (2009)","journal-title":"BMC Bioinf."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M., Magnanti, T.L., Monma, C., Nemhauser, G.L. (eds.) Network Models, Handbooks in Operations Research and Management Science, vol. 7, pp. 503\u2013615. Elsevier Science Publishers, North-Holland (1995)","DOI":"10.1016\/S0927-0507(05)80126-4"},{"key":"4_CR11","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"}],"container-title":["Springer Proceedings in Mathematics &amp; Statistics","Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20788-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T02:52:44Z","timestamp":1675911164000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20788-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031207877","9783031207884"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20788-4_4","relation":{},"ISSN":["2194-1009","2194-1017"],"issn-type":[{"type":"print","value":"2194-1009"},{"type":"electronic","value":"2194-1017"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Congress of APDIO, the Portuguese Operational Research Society","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Figueira da Foz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apdio2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}