Javad Tayyebi

21 papers C 2Journal 19
YearRankTypeTitle / Venue / Authors
2025 C conf
Minimum Topological s-t Cut Problems.
CoDIT
Javad Tayyebi, Adrian Marius Deaconu, Malihe Niksirat
2025 J jnl
Minimum st-cut interdiction problems with convex piecewise-linear costs.
J. Appl. Math. Comput.
Javad Tayyebi, Malihe Niksirat
2025 J jnl
Novel GPU-Based Method for the Generalized Maximum Flow Problem.
Comput.
Delia Elena Spridon, Adrian Marius Deaconu, Javad Tayyebi
2025 J jnl
On Introduction to (
Int. J. Math. Math. Sci.
Muhammad Bilal Khan, Adrian Marius Deaconu, Javad Tayyebi, Bandar Bin-Mohsin, Loredana Ciurdariu, Miguel J. Vivas-Cortez, Nurnadiah Zamri
2025 J jnl
The quickest root-leaf interdiction problem on tree networks.
Discret. Appl. Math.
Huong Nguyen-Thu, Javad Tayyebi, Kien Trung Nguyen, Nguyen Thanh Luan
2024 J jnl
Diamond Intuitionistic Fuzzy Sets and Their Applications.
IEEE Access
Muhammad Bilal Khan, Adrian Marius Deaconu, Javad Tayyebi, Delia Elena Spridon
2024 C conf
Generalized Maximum Capacity Path Problem with Loss Factors.
ICORES
Javad Tayyebi, Mihai-Lucian Rîtan, Adrian Marius Deaconu
2024 J jnl
Robust reverse 1-center problems on trees with interval costs.
Optim. Methods Softw.
Javad Tayyebi, Kien Trung Nguyen
2024 J jnl
Widest Path in Networks with Gains/Losses.
Axioms
Javad Tayyebi, Mihai-Lucian Rîtan, Adrian Marius Deaconu
2023 J jnl
Maximum capacity path problem with loss factors.
CoRR
Adrian Marius Deaconu, Javad Tayyebi, Mihai-Lucian Rîtan
2023 J jnl
Production Planning Games in Uncertain Environment.
New Math. Nat. Comput.
Hamid Bigdeli, Javad Tayyebi, H. Hassanpour
2023 J jnl
Shortest path interdiction problem with convex piecewise-linear costs.
Comput. Appl. Math.
Javad Tayyebi, Adrian Marius Deaconu, Hamid Bigdeli, Malihe Niksirat
2023 J jnl
The continuous maximum capacity path interdiction problem.
Eur. J. Oper. Res.
Javad Tayyebi, Ankan Mitra, Jorge A. Sefair
2020 J jnl
Further Study on Reverse 1-Center Problem on Trees.
Asia Pac. J. Oper. Res.
Ali Reza Sepasian, Javad Tayyebi
2020 J jnl
Inverse Maximum Capacity Path Problems Under Sum-Type and Max-Type Distances and Their Practical Application to Transportation Networks.
IEEE Access
Adrian Marius Deaconu, Javad Tayyebi
2020 J jnl
Minimum st-cut interdiction problem.
Comput. Ind. Eng.
Abolfazl Abdolahzadeh, Massoud Aman, Javad Tayyebi
2020 J jnl
Partial inverse min-max spanning tree problem.
J. Comb. Optim.
Javad Tayyebi, Ali Reza Sepasian
2019 J jnl
Maximum Capacity Path Interdiction Problem with Fixed Costs.
Asia Pac. J. Oper. Res.
Abumoslem Mohammadi, Javad Tayyebi
2018 J jnl
On inverse linear programming problems under the bottleneck-type weighted Hamming distance.
Discret. Appl. Math.
Javad Tayyebi, Massoud Aman
2018 J jnl
Reverse maximum flow problem under the weighted Chebyshev distance.
RAIRO Oper. Res.
Javad Tayyebi, Abumoslem Mohammadi, Seyyed Mohammad Reza Kazemi
2014 J jnl
Note on "Inverse minimum cost flow problems under the weighted Hamming distance".
Eur. J. Oper. Res.
Javad Tayyebi, Massoud Aman