Günes Erdogan
Orcid: 0000-0002-2456-3719
According to our database1,
Günes Erdogan
authored at least 44 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
IEEE Trans. Intell. Transp. Syst., August, 2024
Eur. J. Oper. Res., 2024
2023
Comput. Oper. Res., June, 2023
2022
Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics.
Eur. J. Oper. Res., 2022
Eur. J. Oper. Res., 2022
Comput. Oper. Res., 2022
2021
Transp. Sci., 2021
2020
2019
Decis. Support Syst., 2019
2018
Eur. J. Oper. Res., 2018
2017
Corrigendum to "Hybrid metaheuristics for the clustered vehicle routing problem [Comput. Oper. Res., 58 (2015): 87-99]".
Comput. Oper. Res., 2017
Comput. Oper. Res., 2017
Ann. Oper. Res., 2017
2016
Oper. Res., 2016
Eur. J. Oper. Res., 2016
2015
Matheuristics for solving a multi-attribute collection problem for a charity organisation.
J. Oper. Res. Soc., 2015
An exact algorithm for the static rebalancing problem arising in bicycle sharing systems.
Eur. J. Oper. Res., 2015
Comput. Oper. Res., 2015
2014
Eur. J. Oper. Res., 2014
2013
2012
Modelling and solving an <i>m</i>-location, <i>n</i>-courier, priority-based planning problem on a network.
J. Oper. Res. Soc., 2012
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs.
Comput. Oper. Res., 2012
2011
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem.
Transp. Sci., 2011
Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems.
Discret. Optim., 2011
2010
Transp. Sci., 2010
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem.
Discret. Appl. Math., 2010
2009
Comput. Oper. Res., 2009
2007
A branch-and-cut algorithm for quadratic assignment problems based on linearizations.
Comput. Oper. Res., 2007
2006
Discret. Optim., 2006