A Modified Gradient Procedure for Multifacility Euclidean Distance Location Problems
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | 이채영 | ko |
| dc.date.accessioned | 2011-05-09T02:55:24Z | - |
| dc.date.available | 2011-05-09T02:55:24Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1988-12 | - |
| dc.identifier.citation | 한국경영과학회지, v.13, no.2, pp.25 - 33 | - |
| dc.identifier.issn | 1225-1119 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/23542 | - |
| dc.description.abstract | An efficient heuristic solution procedure is developed for the minimum location problems. The gradient direction method and modified gradient approach are developed due to the differentiability of the objective functions. Suboptimal step size is obtained analytically. A Modified Gradient Procedure (MGP) is presented and compared with the hyperboloid approximation procedure (HAP) which is one of the best known methods. | - |
| dc.language | Korean | - |
| dc.language.iso | en_US | en |
| dc.publisher | 한국경영과학회 | - |
| dc.title | A Modified Gradient Procedure for Multifacility Euclidean Distance Location Problems | - |
| dc.type | Article | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 13 | - |
| dc.citation.issue | 2 | - |
| dc.citation.beginningpage | 25 | - |
| dc.citation.endingpage | 33 | - |
| dc.citation.publicationname | 한국경영과학회지 | - |
| dc.embargo.liftdate | 9999-12-31 | - |
| dc.embargo.terms | 9999-12-31 | - |
| dc.contributor.localauthor | 이채영 | - |
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.