Sharif Digital Repository

The subgradient method is one of the most favoriate methods to solve discrete optimization problems. The Easy Implementation and flexibility enbles us to solve a vast types of complicated combinatorial optimization problems. However, the algorithm can be improved by adjusting its parameters and steps.In present research, we present a heuristic structure to modify and improve the algorithm. Then, the proposed algorithm has tested on special classes of discrete optimization problems such as Generealized Assignment and Uncapacitated Warehouse location problems. The results show that the proposed algorithm can improve the efficiency of the classic form of subgradient method.The three main...