Papers in Journals

#Paper TitleAuthorsJournalPublished At
 
61The quickest root–leaf interdiction problem on tree networksHuong Nguyen-Thu, Javad Tayyebi, Kien Trung Nguyen, Nguyen Thanh Luan,Discrete Applied Mathematics2025
62Efficient network algorithms for two special cases of the weighted set cover problemJ.Tayyebi, A.MohammadiInternational Journal of Management Science and Engineering Management2018
63A modified algorithm for solving the inverse minimum cost flow problem under the bottleneck-type hamming distanceM. aman, H.HassanPour, J. TayyebiBulletin of the Transilvania University of Brasov: series III2016
64Inverse matroid optimization problem under the weighted hamming distancesM. aman, H.HassanPour, J. TayyebiBulletin of the Transilvania University of Brasov: series III2016
65Capacity Inverse Minimum Cost Flow Problem under the Weighted Hamming DistancesM. aman, J. TayyebiIranian Journal of Operations Research2014
Showing 61-65 of 65 items.