{"title":"具有底层三元结构的在线装箱问题","authors":"H. Prodinger","doi":"10.26493/1855-3974.2701.b7d","DOIUrl":null,"url":null,"abstract":"Following an orginal idea by Kn\\\"odel, an online bin-packing problem is considered where the the large items arrive in double-packs. The dual problem where the small items arrive in double-packs is also considered. The enumerations have a ternary random walk flavour, and for the enumeration, the kernel method is employed.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An online bin-packing problem with an underlying ternary structure\",\"authors\":\"H. Prodinger\",\"doi\":\"10.26493/1855-3974.2701.b7d\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Following an orginal idea by Kn\\\\\\\"odel, an online bin-packing problem is considered where the the large items arrive in double-packs. The dual problem where the small items arrive in double-packs is also considered. The enumerations have a ternary random walk flavour, and for the enumeration, the kernel method is employed.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2021-09-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.26493/1855-3974.2701.b7d\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.26493/1855-3974.2701.b7d","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An online bin-packing problem with an underlying ternary structure
Following an orginal idea by Kn\"odel, an online bin-packing problem is considered where the the large items arrive in double-packs. The dual problem where the small items arrive in double-packs is also considered. The enumerations have a ternary random walk flavour, and for the enumeration, the kernel method is employed.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
