Güvenç Sahin

Orcid: 0000-0002-8623-7257

According to our database1, Güvenç Sahin authored at least 19 papers between 2007 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Efficient Algorithms for the Multi-Period Line Planning Problem in Public Transportation (Short Paper).
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2019
A branch-and-price algorithm for the rainbow cycle cover problems.
Networks, 2019

2017
After-sales services network design of a household appliances manufacturer.
J. Oper. Res. Soc., 2017

A column generation based algorithm for the robust graph coloring problem.
Discret. Appl. Math., 2017

Demand-Driven Line Planning with Selfish Routing.
Proceedings of the Operations Research Proceedings 2017, 2017

2016
Line Planning on Path Networks with Application to the Istanbul Metrobüs.
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

2014
A Decomposition-Based Approach for the Multiperiod Multiproduct Distribution Planning Problem.
J. Appl. Math., 2014

Hybrid simulation-analytical modeling approaches for the reverse logistics network design of a third-party logistics provider.
Comput. Ind. Eng., 2014

2013
Solving a robust airline crew pairing problem with column generation.
Comput. Oper. Res., 2013

Workload Balancing in Transportation Crew Rostering.
Proceedings of the Operations Research Proceedings 2013, 2013

2012
A note on "A LP-based heuristic for a time-constrained routing problem".
Eur. J. Oper. Res., 2012

2011
A Column-and-Row Generation Algorithm for a Crew Planning Problem in Railways.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

A branch and cut algorithm for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads.
Proceedings of the 2011 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2011

2010
Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems.
INFORMS J. Comput., 2010

2009
Lower bounding techniques for the degree-constrained network design problem.
Networks, 2009

2008
New approaches for solving the block-to-train assignment problem.
Networks, 2008

Optimal network configuration and capacity expansion of railroads.
J. Oper. Res. Soc., 2008

2007
Locational analysis for regionalization of Turkish Red Crescent blood services.
Comput. Oper. Res., 2007

A review of hierarchical facility location models.
Comput. Oper. Res., 2007


  Loading...