Search published articles

Showing 1 results for Momeni Sarmadi

Masoud Yaghini, Mohsen Momeni, Mohammadreza Momeni Sarmadi,
Volume 25, Issue 2 (IIJEPR 2014)

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is tested on the several standard instances. The results show that the algorithm outperforms the best heuristic approaches found in the literature.

Page 1 from 1     

© 2020 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb