Günes Erdogan

Orcid: 0000-0002-2456-3719

According to our database1, Günes Erdogan authored at least 42 papers between 2006 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Operational Research: methods and applications.
J. Oper. Res. Soc., March, 2024

2023
A Large Neighbourhood Search Algorithm for Solving Container Loading Problems.
Comput. Oper. Res., June, 2023

2022
Communication-aware Drone Delivery Problem Instances.
Dataset, March, 2022

Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics.
Eur. J. Oper. Res., 2022

Logistics planning of cash transfer to Syrian refugees in Turkey.
Eur. J. Oper. Res., 2022

The hub location and pricing problem.
Eur. J. Oper. Res., 2022

Pallet location and job scheduling in a Twin-Robot system.
Comput. Oper. Res., 2022

The ethical shortlisting problem.
Comput. Oper. Res., 2022

Minimum cost delivery of multi-item orders in e-commerce logistics.
Comput. Oper. Res., 2022

2021
Exact and Heuristic Algorithms for the Carrier-Vehicle Traveling Salesman Problem.
Transp. Sci., 2021

Algorithms for the Calzedonia workload allocation problem.
J. Oper. Res. Soc., 2021

2020
Hydra: Report and technical overview.
J. Int. Comput. Games Assoc., 2020

2019
An open source decision support system for facility location analysis.
Decis. Support Syst., 2019

2018
The Chinese Postman Problem with Load-Dependent Costs.
Transp. Sci., 2018

Scheduling twin robots in a palletising problem.
Int. J. Prod. Res., 2018

The Block Retrieval Problem.
Eur. J. Oper. Res., 2018

The Multi-Vehicle Probabilistic Covering Tour Problem.
Eur. J. Oper. Res., 2018

The static bike relocation problem with multiple vehicles and visits.
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

An open source Spreadsheet Solver for Vehicle Routing Problems.
Comput. Oper. Res., 2017

Solving a large-scale integrated fleet assignment and crew pairing problem.
Ann. Oper. Res., 2017

2016
Erratum - Exact Algorithms for the Clustered Vehicle Routing Problem.
Oper. Res., 2016

Exact and heuristic algorithms for the Hamiltonian p-median problem.
Eur. J. Oper. Res., 2016

2015
Guest editorial: Recent trends in vehicle routing.
Networks, 2015

Matheuristics for solving a multi-attribute collection problem for a charity organisation.
J. Oper. Res. Soc., 2015

Solving a large-scale crew pairing problem.
J. Oper. Res. Soc., 2015

An exact algorithm for the static rebalancing problem arising in bicycle sharing systems.
Eur. J. Oper. Res., 2015

Hybrid metaheuristics for the Clustered Vehicle Routing Problem.
Comput. Oper. Res., 2015

2014
Exact Algorithms for the Clustered Vehicle Routing Problem.
Oper. Res., 2014

The static bicycle relocation problem with demand intervals.
Eur. J. Oper. Res., 2014

2013
The orienteering problem with variable profits.
Networks, 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
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs.
Transp. Sci., 2010

Scheduling ambulance crews for maximum coverage.
J. Oper. Res. Soc., 2010

The Attractive Traveling Salesman Problem.
Eur. J. Oper. Res., 2010

A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem.
Discret. Appl. Math., 2010

2009
The pickup and delivery traveling salesman problem with first-in-first-out loading.
Comput. Oper. Res., 2009

2007
A branch-and-cut algorithm for quadratic assignment problems based on linearizations.
Comput. Oper. Res., 2007

2006
A note on a polynomial time solvable case of the quadratic assignment problem.
Discret. Optim., 2006


  Loading...