Please use this identifier to cite or link to this item:
|Title:||A parametric approach for a nonlinear discrete location problem|
|Authors:||Sun, J. |
|Keywords:||Facility location problem|
|Citation:||Sun, J., Gu, Y. (2002). A parametric approach for a nonlinear discrete location problem. Journal of Combinatorial Optimization 6 (2) : 119-132. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1013802826295|
|Abstract:||A discrete location problem is formulated for the design of a postal service network. The cost objective of this problem includes a nonlinear concave component. A parametric integer programming algorithm is developed to find an approximate solution to the problem. The algorithm reduces the problem into a sequence of p-median problems and deals with the nonlinear cost by a node-replacement scheme. Preliminary computational results are presented.|
|Source Title:||Journal of Combinatorial Optimization|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 18, 2019
WEB OF SCIENCETM
checked on Feb 11, 2019
checked on Jan 26, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.