Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network. - Barbaros C. Tansel; Richard L. Francis; Timothy J. Lowe; M.-L. Chen (Oper. Res., 1982)

On Parametric Medians of Trees. - Erhan Erkut; Barbaros C. Tansel (Transp. Sci., 1992)

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)

Move based heuristics for the unidirectional loop network layout problem. - Barbaros C. Tansel; Canan Bilen (Eur. J. Oper. Res., 1998)

On the single-assignment p-hub center problem. - Bahar Yetis Kara; Barbaros Ç. Tansel (Eur. J. Oper. Res., 2000)

The Latest Arrival Hub Location Problem. - Bahar Yetis Kara; Barbaros Ç. Tansel (Manag. Sci., 2001)

The single-assignment hub covering problem: Models and linearizations. - Bahar Yetis Kara; Barbaros C. Tansel (J. Oper. Res. Soc., 2003)

A note on a polynomial time solvable case of the quadratic assignment problem. - Günes Erdogan; Barbaros Ç. Tansel (Discret. Optim., 2006)

A simulation model for military deployment. - Ugur Ziya Yildirim; Ihsan Sabuncuoglu; Barbaros Ç. Tansel (WSC, 2007)

Optimization of transportation requirements in the deployment of military units. - Ibrahim Akgün; Barbaros Ç. Tansel (Comput. Oper. Res., 2007)

A branch-and-cut algorithm for quadratic assignment problems based on linearizations. - Günes Erdogan; Barbaros Ç. Tansel (Comput. Oper. Res., 2007)

A design of experiments approach to military Deployment Planning Problem. - Ugur Ziya Yildirim; Ihsan Sabuncuoglu; Barbaros Ç. Tansel; Ahmet Balcioglu (WSC, 2008)

A multi-modal discrete-event simulation model for military deployment. - Ugur Ziya Yildirim; Barbaros Ç. Tansel; Ihsan Sabuncuoglu (Simul. Model. Pract. Theory, 2009)

Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints. - Ibrahim Akgün; Barbaros Ç. Tansel (Comput. Oper. Res., 2010)

Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems. - Günes Erdogan; Barbaros Ç. Tansel (Discret. Optim., 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)

The multi-terminal maximum-flow network-interdiction problem. - Ibrahim Akgün; Barbaros Ç. Tansel; R. Kevin Wood (Eur. J. Oper. Res., 2011)

Modelling and solving an m-location, n-courier, priority-based planning problem on a network. - Günes Erdogan; Barbaros Ç. Tansel; Ibrahim Akgün (J. Oper. Res. Soc., 2012)

Double bound method for solving the p-center location problem. - Hatice Calik; Barbaros C. Tansel (Comput. Oper. Res., 2013)

p-hub median problem for non-complete networks. - Ibrahim Akgün; Barbaros Ç. Tansel (Comput. Oper. Res., 2018)