Javad Tayyebi

Orcid: 0000-0002-7559-3870

According to our database1, Javad Tayyebi authored at least 14 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Widest Path in Networks with Gains/Losses.
Axioms, February, 2024

Generalized Maximum Capacity Path Problem with Loss Factors.
Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, 2024

2023
Production Planning Games in Uncertain Environment.
New Math. Nat. Comput., November, 2023

Shortest path interdiction problem with convex piecewise-linear costs.
Comput. Appl. Math., October, 2023

The continuous maximum capacity path interdiction problem.
Eur. J. Oper. Res., 2023

Maximum capacity path problem with loss factors.
CoRR, 2023

2020
Partial inverse min-max spanning tree problem.
J. Comb. Optim., 2020

Minimum st-cut interdiction problem.
Comput. Ind. Eng., 2020

Further Study on Reverse 1-Center Problem on Trees.
Asia Pac. J. Oper. Res., 2020

Inverse Maximum Capacity Path Problems Under Sum-Type and Max-Type Distances and Their Practical Application to Transportation Networks.
IEEE Access, 2020

2019
Maximum Capacity Path Interdiction Problem with Fixed Costs.
Asia Pac. J. Oper. Res., 2019

2018
Reverse maximum flow problem under the weighted Chebyshev distance.
RAIRO Oper. Res., 2018

On inverse linear programming problems under the bottleneck-type weighted Hamming distance.
Discret. Appl. Math., 2018

2014
Note on "Inverse minimum cost flow problems under the weighted Hamming distance".
Eur. J. Oper. Res., 2014


  Loading...