A note on "Reducing the number of binary variables in cutting stock problems"

doi:10.1007/s11590-012-0598-x

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Lu, Hao-Chun	en_US
dc.contributor.author	Ko, Yu-Chien	en_US
dc.contributor.author	Huang, Yao-Huei	en_US
dc.date.accessioned	2014-12-08T15:35:06Z	-
dc.date.available	2014-12-08T15:35:06Z	-
dc.date.issued	2014-02-01	en_US
dc.identifier.issn	1862-4472	en_US
dc.identifier.uri	http://dx.doi.org/10.1007/s11590-012-0598-x	en_US
dc.identifier.uri	http://hdl.handle.net/11536/23829	-
dc.description.abstract	This study proposes a deterministic model to solve the two-dimensional cutting stock problem (2DCSP) using a much smaller number of binary variables and thereby reducing the complexity of 2DCSP. Expressing a 2DCSP with stocks and cutting rectangles requires binary variables in the traditional model. In contrast, the proposed model uses binary variables to express the 2DCSP. Experimental results showed that the proposed model is more efficient than the existing model.	en_US
dc.language.iso	en_US	en_US
dc.subject	Deterministic model	en_US
dc.subject	Cutting stock problem	en_US
dc.subject	Binary variables	en_US
dc.title	A note on "Reducing the number of binary variables in cutting stock problems"	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1007/s11590-012-0598-x	en_US
dc.identifier.journal	OPTIMIZATION LETTERS	en_US
dc.citation.volume	8	en_US
dc.citation.issue	2	en_US
dc.citation.spage	569	en_US
dc.citation.epage	579	en_US
dc.contributor.department	資訊管理與財務金融系註：原資管所+財金所	zh_TW
dc.contributor.department	Department of Information Management and Finance	en_US
dc.identifier.wosnumber	WOS:000330949700014	-
dc.citation.woscount	0	-
顯示於類別：	期刊論文

文件中的檔案：

000330949700014.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。