Barbaros Ç. Tansel

According to our database, Barbaros Ç. Tansel authored at least 20 papers between 1982 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2018

<i>p</i>-hub median problem for non-complete networks.

Ibrahim Akgün, Barbaros Ç. Tansel

Comput. Oper. Res., 2018

2013

Double bound method for solving the p-center location problem.

Hatice Calik, Barbaros C. Tansel

Comput. Oper. Res., 2013

2012

Modelling and solving an <i>m</i>-location, <i>n</i>-courier, priority-based planning problem on a network.

Günes Erdogan, Barbaros Ç. Tansel, Ibrahim Akgün

J. Oper. Res. Soc., 2012

2011

The multi-terminal maximum-flow network-interdiction problem.

Ibrahim Akgün, Barbaros Ç. Tansel, R. Kevin Wood

Eur. J. Oper. Res., 2011

New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller-Tucker-Zemlin constraints.

Ibrahim Akgün, Barbaros Ç. Tansel

Eur. J. Oper. Res., 2011

Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems.

Günes Erdogan, Barbaros Ç. Tansel

Discret. Optim., 2011

2010

Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints.

Ibrahim Akgün, Barbaros Ç. Tansel

Comput. Oper. Res., 2010

2009

A multi-modal discrete-event simulation model for military deployment.

Ugur Ziya Yildirim, Barbaros Ç. Tansel, Ihsan Sabuncuoglu

Simul. Model. Pract. Theory, 2009

2008

A design of experiments approach to military Deployment Planning Problem.

Ugur Ziya Yildirim, Ihsan Sabuncuoglu, Barbaros Ç. Tansel, Ahmet Balcioglu

Proceedings of the 2008 Winter Simulation Conference, Global Gateway to Discovery, 2008

2007

A branch-and-cut algorithm for quadratic assignment problems based on linearizations.

Günes Erdogan, Barbaros Ç. Tansel

Comput. Oper. Res., 2007

Optimization of transportation requirements in the deployment of military units.

Ibrahim Akgün, Barbaros Ç. Tansel

Comput. Oper. Res., 2007

A simulation model for military deployment.

Ugur Ziya Yildirim, Ihsan Sabuncuoglu, Barbaros Ç. Tansel

Proceedings of the Winter Simulation Conference, 2007

2006

A note on a polynomial time solvable case of the quadratic assignment problem.

Günes Erdogan, Barbaros Ç. Tansel

Discret. Optim., 2006

2003

The single-assignment hub covering problem: Models and linearizations.

Bahar Yetis Kara, Barbaros C. Tansel

J. Oper. Res. Soc., 2003

2001

The Latest Arrival Hub Location Problem.

Bahar Yetis Kara, Barbaros Ç. Tansel

Manag. Sci., 2001

2000

On the single-assignment p-hub center problem.

Bahar Yetis Kara, Barbaros Ç. Tansel

Eur. J. Oper. Res., 2000

1998

Move based heuristics for the unidirectional loop network layout problem.

Barbaros C. Tansel, Canan Bilen

Eur. J. Oper. Res., 1998

1996

Composite Regions of Feasibility for Certain Classes of Distance Constrained Network Location Problems.

Barbaros Ç. Tansel, Gülcan N. Yesïlkökçen

Transp. Sci., 1996

1992

On Parametric Medians of Trees.

Erhan Erkut, Barbaros C. Tansel

Transp. Sci., 1992

1982

Duality and Distance Constraints for the Nonlinear <i>p</i>-Center Problem and Covering Problem on a Tree Network.

Barbaros C. Tansel, Richard L. Francis, Timothy J. Lowe, M.-L. Chen

Oper. Res., 1982