![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Ibrahim Akgün
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
- [j11]Betül Kayisoglu, Ibrahim Akgün
:
Multiple allocation tree of hubs location problem for non-complete networks. Comput. Oper. Res. 136: 105478 (2021) - [j10]Fatih Kasimoglu
, Ibrahim Akgün
:
Project management in a competitive environment: interdicting a CPM based project and its implications. RAIRO Oper. Res. 55(Supplement): S365-S384 (2021) - 2019
- [j9]Ibrahim Akgün
, Hamit Erdal
:
Solving an ammunition distribution network design problem using multi-objective mathematical modeling, combined AHP-TOPSIS, and GIS. Comput. Ind. Eng. 129: 512-528 (2019) - [j8]Türker Tanergüçlü, Oya Ekin Karasan, Ibrahim Akgün
, Ezhan Karasan
:
Radio Communications Interdiction Problem under deterministic and probabilistic jamming. Comput. Oper. Res. 107: 200-217 (2019) - 2018
- [j7]Ibrahim Akgün
, Barbaros Ç. Tansel:
p-hub median problem for non-complete networks. Comput. Oper. Res. 95: 56-72 (2018) - 2012
- [j6]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
- [j5]Ibrahim Akgün
:
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints. Comput. Oper. Res. 38(1): 277-286 (2011) - [j4]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) - [j3]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
- [j2]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) - 2007
- [j1]Ibrahim Akgün
, Barbaros Ç. Tansel:
Optimization of transportation requirements in the deployment of military units. Comput. Oper. Res. 34(4): 1158-1176 (2007)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint