 | 2012 |
|---|
| 10 |       | Günes Erdogan,
Maria Battarra,
Gilbert Laporte,
Daniele Vigo:
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs.
Computers & OR 39(5): 1074-1086 (2012) |
| 9 | | Günes Erdogan,
Barbaros Ç. Tansel,
Ibrahim Akgün:
Modelling and solving an m-location, n-courier, priority-based planning problem on a network.
JORS 63(1): 2-15 (2012) |
| 2011 |
|---|
| 8 | | Günes Erdogan,
Barbaros Ç. Tansel:
Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems.
Discrete Optimization 8(3): 446-451 (2011) |
| 2010 |
|---|
| 7 | | Günes Erdogan,
Jean-François Cordeau,
Gilbert Laporte:
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem.
Discrete Applied Mathematics 158(15): 1599-1614 (2010) |
| 6 | | Günes Erdogan,
Jean-François Cordeau,
Gilbert Laporte:
The Attractive Traveling Salesman Problem.
European Journal of Operational Research 203(1): 59-69 (2010) |
| 5 | | Günes Erdogan,
Erhan Erkut,
Armann Ingolfsson,
Gilbert Laporte:
Scheduling ambulance crews for maximum coverage.
JORS 61(4): 543-550 (2010) |
| 4 | | Maria Battarra,
Günes Erdogan,
Gilbert Laporte,
Daniele Vigo:
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs.
Transportation Science 44(3): 383-399 (2010) |
| 2009 |
|---|
| 3 | | Günes Erdogan,
Jean-François Cordeau,
Gilbert Laporte:
The pickup and delivery traveling salesman problem with first-in-first-out loading.
Computers & OR 36(6): 1800-1808 (2009) |
| 2007 |
|---|
| 2 | | Günes Erdogan,
Barbaros Ç. Tansel:
A branch-and-cut algorithm for quadratic assignment problems based on linearizations.
Computers & OR 34(4): 1085-1106 (2007) |
| 2006 |
|---|
| 1 | | Günes Erdogan,
Barbaros Ç. Tansel:
A note on a polynomial time solvable case of the quadratic assignment problem.
Discrete Optimization 3(4): 382-384 (2006) |
Data released under the ODC-BY 1.0 license — See also our legal information page