Deaconu, Adrian M., and Javad Tayyebi. "Inverse Maximum Capacity Path Problems Under Sum-Type and Max-Type Distances and Their Practical Application to Transportation Networks." IEEE Access 8 (2020): 225957-225966.
Tayyebi, J., & Deaconu, A. (2021). Expanding maximum capacity path under weighted sum-type distances. AIMS Mathematics, 6(4), 3996-4010.
Tayyebi, Javad, and Elham Hosseinzadeh. "Polynomial form fuzzy numbers and their application in linear programming with fuzzy variables." Italian Journal of Pure and Applied Mathematics: 576.
Nikooravesh, Zohre, and Javad Tayyebi. "A linear programming-based approach to estimate discrete probability functions with given quantiles." Pakistan Journal of Statistics and Operation Research (2020): 839-849.
Abdolahzadeh, A., Aman, M., & Tayyebi, J. (2020). Minimum st-cut interdiction problem. Computers & Industrial Engineering, 148, 106708.
Tayyebi, J., & Sepasian, A. R. (2020). Partial inverse min–max spanning tree problem. Journal of Combinatorial Optimization, 40(4), 1075-1091.
Tayyebi, J., and E. Hosseinzadeh. "A Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data." Journal of AI and Data Mining 8.4 (2020): 515-523.
Sepasian, Ali Reza, and Javad Tayyebi. "Further Study on Reverse 1-Center Problem on Trees." Asia-Pacific Journal of Operational Research (APJOR) 37.06 (2020): 1-18.
Hosseini Nasab, H., & Fakhrzad, M. B. (2020). Multi-objective optimization of population partitioning problem under interval uncertainty. Journal of Industrial and Systems Engineering, 12(4), 172-197.
Tayyebi, Javad, and Adrian Deaconu. "Inverse Generalized Maximum Flow Problems." Mathematics 7.10 (2019): 899.
Mohammadi, Abumoslem, and Javad Tayyebi. "Maximum capacity path interdiction problem with fixed costs." Asia-Pacific Journal of Operational Research 36.04 (2019): 1950018.
Tayyebi, Javad. "On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance." Communications in Combinatorics and Optimization 4.1 (2019): 35-46.
Bigdeli, Hamid, H. Hassanpour, and Javad Tayyebi. "Multiobjective security game with fuzzy payoffs." Iranian Journal of Fuzzy Systems 16.1 (2019): 89-101.
Bigdeli, Hamid, H. Hassanpour, and Javad Tayyebi. "Multiobjective security game with fuzzy payoffs." Iranian Journal of Fuzzy Systems 16.1 (2019): 89-101.
Tayyebi, Javad, Abumoslem Mohammadi, and Seyyed Mohammad Reza Kazemi. "Reverse maximum flow problem under the weighted Chebyshev distance." RAIRO-Operations Research 52.4-5 (2018): 1107-1121.
Aman, Massoud, Hassan Hassanpour, and Javad Tayyebi. "INVERSE MATROID OPTIMIZATION PROBLEM UNDER THE WEIGHTED HAMMING DISTANCES." Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics 9.2 (2016).
Tayyebi, Javad, and Massoud Aman. "On inverse linear programming problems under the bottleneck-type weighted Hamming distance." Discrete Applied Mathematics 240 (2018): 92-101.
Tayyebi, Javad, and Massoud Aman. "INVERSE ECCENTRIC VERTEX PROBLEM ON TREES." PACIFIC JOURNAL OF OPTIMIZATION 14.2 (2018): 245-260.
Tayyebi, J., & Mohammadi, A. (2018). Efficient network algorithms for two special cases of the weighted set cover problem. International Journal of Management Science and Engineering Management, 13(3), 209-214.
Aman, Massoud, and Javad Tayyebi. "Capacity inverse minimum cost flow problem under the weighted Hamming distances." Iranian Journal of Operations Research 5.2 (2014): 0-0.
Tayyebi, J., & Massoud, A. M. A. N. (2016). Efficient algorithms for the reverse shortest path problem on trees under the hamming distance. Yugoslav Journal of Operations Research, 27(1), 46-60.
Aman, Massoud, Hassan Hassanpour, and Javad Tayyebi. "A modified algorithm for solving the inverse minimum cost flow problem under the bottleneck-type Hamming distance." Bulletin of the Transilvania University of Brasov. Mathematics, Informatics, Physics. Series III 9.1 (2016): 97.
Tayyebi, Javad, and Massoud Aman. "Note on “Inverse minimum cost flow problems under the weighted Hamming distance”." European Journal of Operational Research 234.3 (2014): 916-920.