{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T02:45:47Z","timestamp":1777603547340,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,28]],"date-time":"2013-03-28T00:00:00Z","timestamp":1364428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10878-013-9604-1","type":"journal-article","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T01:14:47Z","timestamp":1364346887000},"page":"451-471","source":"Crossref","is-referenced-by-count":14,"title":["Embedding signed graphs in the line"],"prefix":"10.1007","volume":"29","author":[{"given":"Eduardo G.","family":"Pardo","sequence":"first","affiliation":[]},{"given":"Mauricio","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Christopher","family":"Thraves","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,28]]},"reference":[{"issue":"3","key":"9604_CR1","doi-asserted-by":"crossref","first-page":"036","DOI":"10.1103\/PhysRevE.72.036121","volume":"72","author":"T Antal","year":"2005","unstructured":"Antal T, Krapivsky PL, Redner S (2005) Dynamics of social balance on networks. Phys Rev E 72(3):036\u2013121","journal-title":"Phys Rev E"},{"issue":"1\u20133","key":"9604_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal N, Blum A, Chawla S (2004) Correlation clustering. Mach Learn 56(1\u20133):89\u2013113","journal-title":"Mach Learn"},{"key":"9604_CR3","unstructured":"Burkard R, \u00c7ela E, Karisch S, Rendl F (2012) Qaplib: a qudratic assignment problem library. http:\/\/www.opt.math.tu-graz.ac.at\/qaplib\/"},{"key":"9604_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0303-9_27","volume-title":"The quadratic assignment problem","author":"R Burkard","year":"1998","unstructured":"Burkard R, \u00c7ela E, Pardalos P, Pitsoulis L (1998) The quadratic assignment problem. Kluwer Academic Publishers, Dordrecht"},{"issue":"2","key":"9604_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(84)90231-5","volume":"17","author":"R Burkard","year":"1984","unstructured":"Burkard R, Rendl F (1984) A thermodynamically motivated simulation procedure for combinatorial optimization problems. Eur J Oper Res 17(2):169\u2013174","journal-title":"Eur J Oper Res"},{"issue":"5","key":"9604_CR6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D Cartwright","year":"1956","unstructured":"Cartwright D, Harary F (1956) Structural balance: a generalization of Heider\u2019s theory. Psychol Rev 63(5):277\u2013293","journal-title":"Psychol Rev"},{"key":"9604_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The quadratic assignment problem: theory and algorithms","author":"E \u00c7ela","year":"1998","unstructured":"\u00c7ela E (1998) The quadratic assignment problem: theory and algorithms. Kluwer Academic Publishers, Dordrecht"},{"issue":"2","key":"9604_CR8","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"CW Commander","year":"2007","unstructured":"Commander CW (2007) A survey for the quadratic assignment problem. Eur J Oper Res 176(2):657\u2013690","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9604_CR9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"DT Connolly","year":"1990","unstructured":"Connolly DT (1990) An improved annealing scheme for the qap. Eur J Oper Res 46(1):93\u2013100","journal-title":"Eur J Oper Res"},{"key":"9604_CR10","doi-asserted-by":"crossref","unstructured":"Cygan M, Pilipczuk M, Pilipczuk M, Wojtaszczyk JO (2012) Sitting closer to friends than enemies, revisited. In: Proceedings of the 37th international symposium on mathematical foundations of computer science (MFCS) (2012)","DOI":"10.1007\/978-3-642-32589-2_28"},{"issue":"2","key":"9604_CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1177\/001872676702000206","volume":"20","author":"JA Davis","year":"1967","unstructured":"Davis JA (1967) Clustering and structural balance in graphs. Hum Relat 20(2):181\u2013187","journal-title":"Hum Relat"},{"issue":"1","key":"9604_CR12","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"139","author":"Z Drezner","year":"2005","unstructured":"Drezner Z, Hahn PM, Taillard E (2005) Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann Oper Res 139(1):65\u201394","journal-title":"Ann Oper Res"},{"key":"9604_CR13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T Feo","year":"1989","unstructured":"Feo T, Resende M (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8:67\u201371","journal-title":"Oper Res Lett"},{"key":"9604_CR14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T Feo","year":"1995","unstructured":"Feo T, Resende M (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013133","journal-title":"J Glob Optim"},{"key":"9604_CR15","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T Feo","year":"1994","unstructured":"Feo T, Resende M, Smith S (1994) A greedy randomized adaptive search procedure for maximum independent set. Oper Res 42:860\u2013878","journal-title":"Oper Res"},{"issue":"2","key":"9604_CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F Harary","year":"1953","unstructured":"Harary F (1953) On the notion of balance of a signed graph. Mich Math J 2(2):143\u2013146","journal-title":"Mich Math J"},{"issue":"1","key":"9604_CR17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0165-4896(80)90010-4","volume":"1","author":"F Harary","year":"1980","unstructured":"Harary F, Kabell JA (1980) A simple algorithm to detect balance in signed graphs. Math Soc Sci 1(1): 131\u2013136","journal-title":"Math Soc Sci"},{"key":"9604_CR18","doi-asserted-by":"crossref","unstructured":"Kermarrec AM, Thraves C (2011) Can everybody sit closer to their friends than their enemies? In: Proceedings of the 36th international symposium on mathematical foundations of computer science (MFCS), pp 388\u2013399","DOI":"10.1007\/978-3-642-22993-0_36"},{"issue":"1","key":"9604_CR19","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econometrica 25(1):53\u201376","journal-title":"Econometrica"},{"key":"9604_CR20","doi-asserted-by":"crossref","unstructured":"Kunegis J, Schmidt S, Lommatzsch A, Lerner J, Luca EWD, Albayrak S (2010) Spectral analysis of signed graphs for clustering, prediction and visualization. In: Proceedings of the SIAM international conference on data mining (SDM), pp 559\u2013571","DOI":"10.1137\/1.9781611972801.49"},{"key":"9604_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher DP, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: Proceedings of the 19th international conference on world wide web (WWW), pp 641\u2013650","DOI":"10.1145\/1772690.1772756"},{"key":"9604_CR22","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher DP, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the 28th international conference on human factors in computing systems (CHI), pp 1361\u20131370","DOI":"10.1145\/1753326.1753532"},{"issue":"2","key":"9604_CR23","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola EM, de Abreu NMM, Boaventura-Netto PO, Hahn P, Querido T (2007) A survey for the quadratic assignment problem. Eur J Oper Res 176(2):657\u2013690","journal-title":"Eur J Oper Res"},{"issue":"45\u201348","key":"9604_CR24","first-page":"2293","volume":"1","author":"HM Nehi","year":"2007","unstructured":"Nehi HM, Gelareh S (2007) A survey of meta-heuristic solution methods for the quadratic assignment problem. Appl Math Sci 1(45\u201348):2293\u20132312","journal-title":"Appl Math Sci"},{"key":"9604_CR25","unstructured":"Pardalos PM, Rendl F. Wolkowicz H (1994) The quadratic assignment problem: a survey and recent developments. In: Proceedings of the DIMACS workshop on quadratic assignment problems, volume 16 of DIMACS series in discrete mathematics and theoretical computer science. American Mathematical Society, Providence, pp 1\u201342"},{"key":"9604_CR26","doi-asserted-by":"crossref","unstructured":"Resende M, Ribeiro C (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger FS, Hillier CC, Price (eds) Handbook of metaheuristics, international series in operations research and management science, vol 57. Springer, New York, pp 219\u2013249","DOI":"10.1007\/0-306-48056-5_8"},{"issue":"3","key":"9604_CR27","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM 23(3):555\u2013565","journal-title":"J ACM"},{"issue":"1","key":"9604_CR28","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J Skorin-Kapov","year":"1990","unstructured":"Skorin-Kapov J (1990) Tabu search applied to the quadratic assignment problem. ORSA J Comput 2(1): 33\u201345","journal-title":"ORSA J Comput"},{"key":"9604_CR29","doi-asserted-by":"crossref","unstructured":"Szell M, Lambiotte R, Thurner S (2010) Multirelational organization of large-scale social networks in an online world. Proc Natl Acad Sci USA (PNAS) 107(31), 13, 636\u201313, 641 (2010)","DOI":"10.1073\/pnas.1004008107"},{"issue":"45","key":"9604_CR30","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E Taillard","year":"1991","unstructured":"Taillard E (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17(45): 443\u2013455","journal-title":"Parallel Comput"},{"key":"9604_CR31","unstructured":"Taillard E (1998) Fant: fast ant system. Technical report, Dalle Molle Institute for Artificial Intelligence, Lugano"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9604-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9604-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9604-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T07:38:12Z","timestamp":1562830692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9604-1"}},"subtitle":["Heuristics to solve MinSA problem"],"short-title":[],"issued":{"date-parts":[[2013,3,28]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9604"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9604-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,28]]}}}