Please use this identifier to cite or link to this item: https://doi.org/10.1023/A:1013802826295
Title: A parametric approach for a nonlinear discrete location problem
Authors: Sun, J. 
Gu, Y.
Keywords: Facility location problem
Heuristic algorithm
Integer programming
Issue Date: 2002
Source: 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
URI: http://scholarbank.nus.edu.sg/handle/10635/44004
ISSN: 13826905
DOI: 10.1023/A:1013802826295
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

2
checked on Nov 21, 2017

Page view(s)

51
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.