{"title":"基于切伪基的二次分配问题的一种新的SDP松弛","authors":"Maximilian John, A. Karrenbauer","doi":"10.1007/978-3-319-45587-7_36","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases\",\"authors\":\"Maximilian John, A. Karrenbauer\",\"doi\":\"10.1007/978-3-319-45587-7_36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":307867,\"journal\":{\"name\":\"International Symposium on Combinatorial Optimization\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Combinatorial Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-45587-7_36\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Combinatorial Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-45587-7_36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}