Pub Date : 1900-01-01DOI: 10.1007/978-1-4757-3023-4_3
E. Coffman, G. Galambos, S. Martello, D. Vigo
{"title":"Bin Packing Approximation Algorithms: Combinatorial Analysis","authors":"E. Coffman, G. Galambos, S. Martello, D. Vigo","doi":"10.1007/978-1-4757-3023-4_3","DOIUrl":"https://doi.org/10.1007/978-1-4757-3023-4_3","url":null,"abstract":"","PeriodicalId":119466,"journal":{"name":"Handbook of Combinatorial Optimization","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115652919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-1-4757-3145-3_2
J. Albrecht, D. Cieslik
{"title":"The Steiner Ratio of L p -planes","authors":"J. Albrecht, D. Cieslik","doi":"10.1007/978-1-4757-3145-3_2","DOIUrl":"https://doi.org/10.1007/978-1-4757-3145-3_2","url":null,"abstract":"","PeriodicalId":119466,"journal":{"name":"Handbook of Combinatorial Optimization","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127715177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-1-4757-3023-4_5
T. Trafalis, S. Kasap
{"title":"Neural Networks Approaches for Combinatorial Optimization Problems","authors":"T. Trafalis, S. Kasap","doi":"10.1007/978-1-4757-3023-4_5","DOIUrl":"https://doi.org/10.1007/978-1-4757-3023-4_5","url":null,"abstract":"","PeriodicalId":119466,"journal":{"name":"Handbook of Combinatorial Optimization","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130351550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-1-4757-3023-4_7
J. Gu, P. Purdom, J. Franco, B. Wah
{"title":"Algorithms for the Satisfiability (SAT) Problem","authors":"J. Gu, P. Purdom, J. Franco, B. Wah","doi":"10.1007/978-1-4757-3023-4_7","DOIUrl":"https://doi.org/10.1007/978-1-4757-3023-4_7","url":null,"abstract":"","PeriodicalId":119466,"journal":{"name":"Handbook of Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128883580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-1-4757-3023-4_6
R. Murphey, P. Pardalos, M. G. Resende
{"title":"Frequency Assignment Problems","authors":"R. Murphey, P. Pardalos, M. G. Resende","doi":"10.1007/978-1-4757-3023-4_6","DOIUrl":"https://doi.org/10.1007/978-1-4757-3023-4_6","url":null,"abstract":"","PeriodicalId":119466,"journal":{"name":"Handbook of Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130127198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-1-4757-3023-4_2
R. Burkard, E. Çela
{"title":"Linear Assignment Problems and Extensions","authors":"R. Burkard, E. Çela","doi":"10.1007/978-1-4757-3023-4_2","DOIUrl":"https://doi.org/10.1007/978-1-4757-3023-4_2","url":null,"abstract":"","PeriodicalId":119466,"journal":{"name":"Handbook of Combinatorial Optimization","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130601015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：