كليدواژه :
Newt work flow , link-path model , جريان در شبكه , Piecewise linear concave function , subgradient method , روشهاي جستجوي تصادفي , lagrangian relaxation method , مدل يال - مسير , random search methods , تابع خطي قطعه بندي شده مقعر , روش ساده سازي لاگرانژي , روش زيرگراديان
چكيده لاتين :
In this paper the problem of minimum cost communication network design is considered where the costs are Piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.
