Tansel Barbaros

Barbaros Tansel

Information about the author Barbaros Tansel will soon be added to the site.
Found 4 papers in total
New formulations of the Hop‐Constrained Minimum Spanning Tree problem via Miller–Tucker–Zemlin constraints
New formulations of the Hop‐Constrained Minimum Spanning Tree problem via Miller–Tucker–Zemlin constraints
2011
Given an undirected network with positive edge costs and a natural number p , the...
Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems
Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems
2011
The Quadratic Assignment Problem is one of the hardest combinatorial optimization...
The multi‐terminal maximum‐flow network‐interdiction problem
The multi‐terminal maximum‐flow network‐interdiction problem
2011
This paper defines and studies the multi‐terminal maximum‐flow...
A spanning tree approach to the absolute p-center problem
A spanning tree approach to the absolute p-center problem
1998
We consider the absolute p -center problem on a general network and propose a spanning...
Papers per page: