Massoud Aman

According to our database, Massoud Aman authored at least 6 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Minimum s-t hypercut in (s, t)-planar hypergraphs.

Abolfazl Hassanpour, Massoud Aman, Alireza Ebrahimi

J. Comb. Optim., December, 2024

A Weighted Inverse Minimum s - t Cut Problem with Value Constraint Under the Bottleneck-Type Hamming Distance.

Elham Ramzani Ghalebala, Massoud Aman, Nasim Nasrabadi

Asia Pac. J. Oper. Res., February, 2024

2020

Minimum st-cut interdiction problem.

Abolfazl Abdolahzadeh, Massoud Aman, Javad Tayyebi

Comput. Ind. Eng., 2020

2018

On inverse linear programming problems under the bottleneck-type weighted Hamming distance.

Javad Tayyebi, Massoud Aman

Discret. Appl. Math., 2018

2017

Inverse Multi-objective Shortest Path Problem Under the Bottleneck Type Weighted Hamming Distance.

Mobarakeh Karimi, Massoud Aman, Ardeshir Dolati

Proceedings of the Topics in Theoretical Computer Science, 2017

2014

Note on "Inverse minimum cost flow problems under the weighted Hamming distance".

Javad Tayyebi, Massoud Aman

Eur. J. Oper. Res., 2014