1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorTsai, JFen_US
dc.contributor.authorLi, HLen_US
dc.date.accessioned2014-12-08T15:18:23Z-
dc.date.available2014-12-08T15:18:23Z-
dc.date.issued2005-09-16en_US
dc.identifier.issn0377-2217en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.ejor.2004.03.010en_US
dc.identifier.urihttp://hdl.handle.net/11536/13264-
dc.description.abstractMultidisk vertical allocation (MDVA) problems intend to find an allocation of relations to disks such that the expected query cost is minimized. Recently, Chang [European Journal of Operational Research 143 (2002) 210] modified Rotem et al.'s [IEEE Transactions on Knowledge and Data Engineering 5 (1993) 882] method for solving an MDVA problem using a smaller number of binary variables. Chang's method however is unable to treat MDVA problems with possible replication of relations. This paper proposes another method to solve MDVA problems, which is more effective than Rotem et al.'s and is able to treat replication problems insolvable by Chang's method. (c) 2004 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectdata allocationen_US
dc.subjectlinearizationen_US
dc.subjectglobal optimizationen_US
dc.titleTechnical note - On optimization approach for multidisk vertical allocation problemsen_US
dc.typeEditorial Materialen_US
dc.identifier.doi10.1016/j.ejor.2004.03.010en_US
dc.identifier.journalEUROPEAN JOURNAL OF OPERATIONAL RESEARCHen_US
dc.citation.volume165en_US
dc.citation.issue3en_US
dc.citation.spage835en_US
dc.citation.epage842en_US
dc.contributor.department資訊管理與財務金融系 註：原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000228123800021-
dc.citation.woscount2-
Appears in Collections:Articles


Files in This Item:

  1. 000228123800021.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...