Zeynep Suvak

According to our database, Zeynep Suvak authored at least 5 papers between 2015 and 2021.

Collaborative distances:

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

2021

Minimum cost flow problem with conflicts.

Zeynep Suvak, I. Kuban Altinel, Necati Aras

Networks, 2021

2020

Exact solution algorithms for the maximum flow problem with additional conflict constraints.

Zeynep Suvak, I. Kuban Altinel, Necati Aras

Eur. J. Oper. Res., 2020

2019

Minimum cost noncrossing flow problem on layered networks.

I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin

Discret. Appl. Math., 2019

Assignment problem with conflicts.

Temel Öncan, Zeynep Suvak, M. Hakan Akyüz, I. Kuban Altinel

Comput. Oper. Res., 2019

2015

Minimum Cost Noncrossing Flow Problem on a Layered Network.

Yavuz Bogaç Türkogullari, I. Kuban Altinel, Z. Caner Taskin, Zeynep Suvak, Necati Aras

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015