default search action
Güvenç Sahin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Saeedeh Ahmadi Basir
, Güvenç Sahin
A comparative study of alternative formulations for the periodic vehicle routing problem. Comput. Oper. Res. 165: 106583 (2024) - 2021
- [c6]Güvenç Sahin, Amin Ahmadi Digehsara
Efficient Algorithms for the Multi-Period Line Planning Problem in Public Transportation (Short Paper). ATMOS 2021: 17:1-17:6
2010 – 2019
- 2019
- [j13]Birol Yüceoglu
A branch-and-price algorithm for the rainbow cycle cover problems. Networks 74(1): 3-15 (2019) - 2017
- [j12]Birol Yüceoglu
A column generation based algorithm for the robust graph coloring problem. Discret. Appl. Math. 217: 340-352 (2017) - [j11]Fatma Tevhide Altekin
After-sales services network design of a household appliances manufacturer. J. Oper. Res. Soc. 68(9): 1056-1067 (2017) - [c5]Malte Renken, Amin Ahmadi, Ralf Borndörfer, Güvenç Sahin, Thomas Schlechte:
Demand-Driven Line Planning with Selfish Routing. OR 2017: 687-692 - 2016
- [c4]Ralf Borndörfer, Oytun Arslan, Ziena Elijazyfer
Line Planning on Path Networks with Application to the Istanbul Metrobüs. OR 2016: 235-241 - 2014
- [j10]Ali Çetin Suyabatmaz, Fatma Tevhide Altekin, Güvenç Sahin
Hybrid simulation-analytical modeling approaches for the reverse logistics network design of a third-party logistics provider. Comput. Ind. Eng. 70: 74-89 (2014) - [j9]Seyed Ahmad Hosseini
A Decomposition-Based Approach for the Multiperiod Multiproduct Distribution Planning Problem. J. Appl. Math. 2014: 825058:1-825058:25 (2014) - 2013
- [j8]Ibrahim Muter, S. Ilker Birbil, Kerem Bülbül
Solving a robust airline crew pairing problem with column generation. Comput. Oper. Res. 40(3): 815-830 (2013) - [c3]Güvenç Sahin, Fardin Dashty Saridarq:
Workload Balancing in Transportation Crew Rostering. OR 2013: 383-388 - 2012
- [j7]Ibrahim Muter, S. Ilker Birbil, Kerem Bülbül
A note on "A LP-based heuristic for a time-constrained routing problem". Eur. J. Oper. Res. 221(2): 306-307 (2012) - 2011
- [c2]Temel Öncan, Dilek Tuzun Aksu
A branch and cut algorithm for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads. IEEM 2011: 1864-1868 - [c1]Ali Çetin Suyabatmaz, Güvenç Sahin:
A Column-and-Row Generation Algorithm for a Crew Planning Problem in Railways. OR 2011: 335-340 - 2010
- [j6]Ibrahim Muter, S. Ilker Birbil, Güvenç Sahin
Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems. INFORMS J. Comput. 22(4): 603-619 (2010)
2000 – 2009
- 2009
- [j5]Güvenç Sahin
Lower bounding techniques for the degree-constrained network design problem. Networks 53(4): 334-344 (2009) - 2008
- [j4]Jian Liu, Ravindra K. Ahuja, Güvenç Sahin
Optimal network configuration and capacity expansion of railroads. J. Oper. Res. Soc. 59(7): 911-920 (2008) - [j3]Krishna C. Jha, Ravindra K. Ahuja, Güvenç Sahin
New approaches for solving the block-to-train assignment problem. Networks 51(1): 48-62 (2008) - 2007
- [j2]Güvenç Sahin
Locational analysis for regionalization of Turkish Red Crescent blood services. Comput. Oper. Res. 34(3): 692-704 (2007) - [j1]Güvenç Sahin
A review of hierarchical facility location models. Comput. Oper. Res. 34(8): 2310-2331 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: