DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Heeseok | ko |
dc.contributor.author | SHENG, ORL | ko |
dc.date.accessioned | 2013-02-25T00:06:35Z | - |
dc.date.available | 2013-02-25T00:06:35Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1992-01 | - |
dc.identifier.citation | COMPUTERS OPERATIONS RESEARCH, v.19, no.1, pp.21 - 33 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/10203/58279 | - |
dc.description.abstract | This paper addresses a multiple objective optimization model to determine the file allocation and query routing assignment in a distributed information system. The problem is formulated as a zero-one integer nonlinear programming problem with multiple objectives. The optimization problem under consideration is shown to be NP-hard. We adopt an iterative improvement procedure, which gives the Pareto optimal solution. We further illustrate our methodology with a small sample system. | - |
dc.language | English | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | COMPUTER-SYSTEMS | - |
dc.subject | DESIGN | - |
dc.subject | METHODOLOGY | - |
dc.subject | NETWORK | - |
dc.title | A MULTIPLE CRITERIA MODEL FOR THE ALLOCATION OF DATA FILES IN A DISTRIBUTED INFORMATION-SYSTEM | - |
dc.type | Article | - |
dc.identifier.wosid | A1992HD87900003 | - |
dc.identifier.scopusid | 2-s2.0-0026679714 | - |
dc.type.rims | ART | - |
dc.citation.volume | 19 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 21 | - |
dc.citation.endingpage | 33 | - |
dc.citation.publicationname | COMPUTERS OPERATIONS RESEARCH | - |
dc.identifier.doi | 10.1016/0305-0548(92)90056-B | - |
dc.contributor.localauthor | Lee, Heeseok | - |
dc.contributor.nonIdAuthor | SHENG, ORL | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | COMPUTER-SYSTEMS | - |
dc.subject.keywordPlus | DESIGN | - |
dc.subject.keywordPlus | METHODOLOGY | - |
dc.subject.keywordPlus | NETWORK | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.