完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | LI, HL | en_US |
dc.date.accessioned | 2014-12-08T15:04:06Z | - |
dc.date.available | 2014-12-08T15:04:06Z | - |
dc.date.issued | 1994-03-01 | en_US |
dc.identifier.issn | 0305-0548 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/2603 | - |
dc.description.abstract | Given a 0-1 polynomial expression SIGMA(k=1)N-1 SIGMA(m=k+1)N x(k)x(m), where x(k) and x(m) are 0-1 variables, the famous Glover and Woolsey method required to use N(N - 1)/2 additional continuous variables and 2N(N - 1) linear constraints to transform this expression into a linear form. This paper proposes a method which first reformulates the above expression as a new expression SIGMA(k=1)N x(k)y(k), y(k) = SIGMA(m=k+1)N x(m); then to transform the expression into a linear form where x(k) and y(k) are separated. The proposed transformation method only required to use 2(N - 1) additional continuous variables and 8(N - 1) linear constraints. Based on the new transformation, a 0-1 polynomial program can be more effectively solved to obtain a global optimum. | en_US |
dc.language.iso | en_US | en_US |
dc.title | A NEW GLOBAL APPROACH FOR 0-1 POLYNOMIAL PROGRAMS | en_US |
dc.type | Article | en_US |
dc.identifier.journal | COMPUTERS & OPERATIONS RESEARCH | en_US |
dc.citation.volume | 21 | en_US |
dc.citation.issue | 3 | en_US |
dc.citation.spage | 319 | en_US |
dc.citation.epage | 327 | en_US |
dc.contributor.department | 交大名義發表 | zh_TW |
dc.contributor.department | 資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department | National Chiao Tung University | en_US |
dc.contributor.department | Department of Information Management and Finance | en_US |
dc.identifier.wosnumber | WOS:A1994MW53900008 | - |
dc.citation.woscount | 1 | - |
顯示於類別: | 期刊論文 |