完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHwang, FKen_US
dc.contributor.authorOnn, Sen_US
dc.contributor.authorRothblum, UGen_US
dc.date.accessioned2014-12-08T15:45:19Z-
dc.date.available2014-12-08T15:45:19Z-
dc.date.issued2000-05-01en_US
dc.identifier.issn0167-6377en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0167-6377(99)00069-3en_US
dc.identifier.urihttp://hdl.handle.net/11536/30546-
dc.description.abstractWe establish the polynomial-time solvability of a class of vector partition problems with linear objectives subject to restrictions on the number of elements in each part. (C) 2000 Published by Elsevier Science B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.titleLinear-shaped partition problemsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0167-6377(99)00069-3en_US
dc.identifier.journalOPERATIONS RESEARCH LETTERSen_US
dc.citation.volume26en_US
dc.citation.issue4en_US
dc.citation.spage159en_US
dc.citation.epage163en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000087249600003-
dc.citation.woscount6-
顯示於類別:期刊論文


文件中的檔案:

  1. 000087249600003.pdf

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