Barbaros Ç. Tansel

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
p-hub median problem for non-complete networks.
Computers & OR, 2018

2013
Double bound method for solving the p-center location problem.
Computers & OR, 2013

2012
Modelling and solving an m-location, n-courier, priority-based planning problem on a network.
JORS, 2012

2011
The multi-terminal maximum-flow network-interdiction problem.
European Journal of Operational Research, 2011

New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller-Tucker-Zemlin constraints.
European Journal of Operational Research, 2011

Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems.
Discrete Optimization, 2011

2010
Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints.
Computers & OR, 2010

2009
A multi-modal discrete-event simulation model for military deployment.
Simulation Modelling Practice and Theory, 2009

2008
A design of experiments approach to military Deployment Planning Problem.
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.
Computers & OR, 2007

Optimization of transportation requirements in the deployment of military units.
Computers & OR, 2007

A simulation model for military deployment.
Proceedings of the Winter Simulation Conference, WSC 2007, 2007

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

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

2001
The Latest Arrival Hub Location Problem.
Management Science, 2001

2000
On the single-assignment p-hub center problem.
European Journal of Operational Research, 2000

1998
Move based heuristics for the unidirectional loop network layout problem.
European Journal of Operational Research, 1998

1996
Composite Regions of Feasibility for Certain Classes of Distance Constrained Network Location Problems.
Transportation Science, 1996

1992
On Parametric Medians of Trees.
Transportation Science, 1992

1982
Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network.
Operations Research, 1982


  Loading...