Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions. - Ferydoon Kianfar (Oper. Res., 1971)

Technical Note - Stronger Inequalities for 0-1 Integer Programming: Computational Refinements. - Ferydoon Kianfar (Oper. Res., 1976)

Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms. - Mohammad Ranjbar; Fereydoon Kianfar (Appl. Math. Comput., 2007)

A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. - Shahram Shadrokh; Fereydoon Kianfar (Eur. J. Oper. Res., 2007)

Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. - Mohammad Ranjbar; Fereydoon Kianfar; Shahram Shadrokh (Appl. Math. Comput., 2008)

An efficient optimal algorithm for the quantity discount problem in material requirement planning. - S. Hamid Mirmohammadi; Shahram Shadrokh; Fereydoon Kianfar (Comput. Oper. Res., 2009)

A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling. - Mohammad Ranjbar; Bert De Reyck; Fereydoon Kianfar (Eur. J. Oper. Res., 2009)

An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem. - Mohammad Ranjbar; Mohammad Khalilzadeh; Fereydoon Kianfar; Kobra Etminani (Comput. Ind. Eng., 2012)