{"title":"组合包装问题","authors":"R. Borndörfer","doi":"10.1137/1.9780898718805.ch3","DOIUrl":null,"url":null,"abstract":"This article investigates a certain class of combinatorial packing problems and some polyhedral relations between such problems and the set packing problem.","PeriodicalId":416196,"journal":{"name":"The Sharpest Cut","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Combinatorial Packing Problems\",\"authors\":\"R. Borndörfer\",\"doi\":\"10.1137/1.9780898718805.ch3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article investigates a certain class of combinatorial packing problems and some polyhedral relations between such problems and the set packing problem.\",\"PeriodicalId\":416196,\"journal\":{\"name\":\"The Sharpest Cut\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Sharpest Cut\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9780898718805.ch3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Sharpest Cut","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9780898718805.ch3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This article investigates a certain class of combinatorial packing problems and some polyhedral relations between such problems and the set packing problem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
