default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBarbaros Ç. Tansel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j18]Ibrahim Akgün
, Barbaros Ç. Tansel:
p-hub median problem for non-complete networks. Comput. Oper. Res. 95: 56-72 (2018)- 2013
- [j17]Hatice Calik, Barbaros C. Tansel:
Double bound method for solving the p-center location problem. Comput. Oper. Res. 40(12): 2991-2999 (2013) - 2012
- [j16]Günes Erdogan, Barbaros Ç. Tansel, Ibrahim Akgün:
Modelling and solving an m-location, n-courier, priority-based planning problem on a network. J. Oper. Res. Soc. 63(1): 2-15 (2012) - 2011
- [j15]Günes Erdogan, Barbaros Ç. Tansel:
Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems. Discret. Optim. 8(3): 446-451 (2011) - [j14]Ibrahim Akgün, Barbaros Ç. Tansel, R. Kevin Wood:
The multi-terminal maximum-flow network-interdiction problem. Eur. J. Oper. Res. 211(2): 241-251 (2011) - [j13]Ibrahim Akgün, Barbaros Ç. Tansel:
New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller-Tucker-Zemlin constraints. Eur. J. Oper. Res. 212(2): 263-276 (2011) - 2010
- [j12]Ibrahim Akgün, Barbaros Ç. Tansel:
Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints. Comput. Oper. Res. 37(1): 72-82 (2010) - 2009
- [j11]Ugur Ziya Yildirim, Barbaros Ç. Tansel, Ihsan Sabuncuoglu:
A multi-modal discrete-event simulation model for military deployment. Simul. Model. Pract. Theory 17(4): 597-611 (2009) - 2007
- [j10]Günes Erdogan, Barbaros Ç. Tansel:
A branch-and-cut algorithm for quadratic assignment problems based on linearizations. Comput. Oper. Res. 34(4): 1085-1106 (2007) - [j9]Ibrahim Akgün, Barbaros Ç. Tansel:
Optimization of transportation requirements in the deployment of military units. Comput. Oper. Res. 34(4): 1158-1176 (2007) - 2006
- [j8]Günes Erdogan, Barbaros Ç. Tansel:
A note on a polynomial time solvable case of the quadratic assignment problem. Discret. Optim. 3(4): 382-384 (2006) - 2003
- [j7]Bahar Yetis Kara, Barbaros C. Tansel:
The single-assignment hub covering problem: Models and linearizations. J. Oper. Res. Soc. 54(1): 59-64 (2003) - 2001
- [j6]Bahar Yetis Kara, Barbaros Ç. Tansel:
The Latest Arrival Hub Location Problem. Manag. Sci. 47(10): 1408-1420 (2001) - 2000
- [j5]Bahar Yetis Kara, Barbaros Ç. Tansel:
On the single-assignment p-hub center problem. Eur. J. Oper. Res. 125(3): 648-655 (2000) - 1998
- [j4]Barbaros C. Tansel, Canan Bilen:
Move based heuristics for the unidirectional loop network layout problem. Eur. J. Oper. Res. 108(1): 36-48 (1998) - 1996
- [j3]Barbaros Ç. Tansel, Gülcan N. Yesïlkökçen:
Composite Regions of Feasibility for Certain Classes of Distance Constrained Network Location Problems. Transp. Sci. 30(2): 148-159 (1996) - 1992
- [j2]Erhan Erkut, Barbaros C. Tansel:
On Parametric Medians of Trees. Transp. Sci. 26(2): 149-156 (1992) - 1982
- [j1]Barbaros C. Tansel, Richard L. Francis, Timothy J. Lowe, M.-L. Chen:
Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network. Oper. Res. 30(4): 725-744 (1982)
Conference and Workshop Papers
- 2008
- [c2]Ugur Ziya Yildirim, Ihsan Sabuncuoglu, Barbaros Ç. Tansel, Ahmet Balcioglu:
A design of experiments approach to military Deployment Planning Problem. WSC 2008: 1234-1241 - 2007
- [c1]Ugur Ziya Yildirim, Ihsan Sabuncuoglu, Barbaros Ç. Tansel:
A simulation model for military deployment. WSC 2007: 1361-1369
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
