Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Barbaros Ç. Tansel"'
Autor:
İbrahim Akgün, Barbaros Ç. Tansel
Publikováno v:
Computers and Operations Research
Most hub location studies in the literature use a complete-network structure as an input in developing optimization models. This starting point is not necessarily from assuming that the underlying real-world network (e.g., physical network such as ro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c7f8a2110fd3555080f4e73cb39170e
https://hdl.handle.net/11693/49855
https://hdl.handle.net/11693/49855
Autor:
Barbaros Ç. Tansel, Hatice Calik
Publikováno v:
Computers and Operations Research
We give a review of existing methods for solving the absolute and vertex restricted p-center problems on networks and propose a new integer programming formulation, a tightened version of this formulation and a new method based on successive restrict
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::566da40f6c2f9c11f38b81bb5d9d8a94
https://doi.org/10.1016/j.cor.2013.07.011
https://doi.org/10.1016/j.cor.2013.07.011
Autor:
Barbaros Ç. Tansel, İbrahim Akgün
Publikováno v:
Computers & Operations Research
Computers and Operations Research
Computers and Operations Research
Cataloged from PDF version of article. We study the deployment planning problem (DPP) that may roughly be defined as the problem of the planning of the physical movement of military units, stationed at geographically dispersed locations, from their h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af95ecb4d334a4990fb4a993840c6a8d
https://doi.org/10.1016/j.cor.2005.06.016
https://doi.org/10.1016/j.cor.2005.06.016
Publikováno v:
Transportation Research Part B: Methodological
Cataloged from PDF version of article. Traffic management during an evacuation and the decision of where to locate the shelters are of critical importance to the performance of an evacuation plan. From the evacuation management authority’s point of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cc91e1660e13aa3b14427b4f7e74eb4
https://hdl.handle.net/11693/12540
https://hdl.handle.net/11693/12540
Autor:
Bahar Y. Kara, Barbaros Ç. Tansel
Publikováno v:
Management Science
The traditionally studied hub location problems in the literature pay attention to flight times but not to transient times spent at hubs for unloading, loading, and sorting operations. The transient times may constitute a significant portion of the t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f93de43216d60550d65033178b0405d
https://doi.org/10.1287/mnsc.47.10.1408.10258
https://doi.org/10.1287/mnsc.47.10.1408.10258
Publikováno v:
IIE Transactions. 33:661-674
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a37c56a024e68c16b5ce63a58f45fd5f
https://doi.org/10.1080/07408170108936862
https://doi.org/10.1080/07408170108936862
Publikováno v:
IIE Transactions. 33:661-674
This paper presents an exact algorithm for the single machine total tardiness problem (1//∑T i). We present a new synthesis of various results from the literature which leads to a compact and concise representation of job precedences, a simple opti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81bb781e9ff5e854b6fe1a2585e128de
https://doi.org/10.1023/a:1010931215795
https://doi.org/10.1023/a:1010931215795
Publikováno v:
Journal of the Operational Research Society
Due to copyright restrictions, the access to the full text of this article is only available via subscription. In this paper, we study an m-location, n-courier, priority-based planning problem on a network, which we refer to as the Courier Planning P
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e994694965b85e217db4efe330802bcb
https://hdl.handle.net/11693/21635
https://hdl.handle.net/11693/21635
Autor:
İbrahim Akgün, Barbaros Ç. Tansel
Publikováno v:
European Journal of Operational Research
Given an undirected network with positive edge costs and a natural number p, the Hop-Constrained Minimum Spanning Tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path starting from a specified root
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3e54a384f139921af97672955bb4c2b
https://hdl.handle.net/11693/13391
https://hdl.handle.net/11693/13391
Autor:
Barbaros Ç. Tansel
Publikováno v:
International Series in Operations Research and Management Science
International Series in Operations Research & Management Science ISBN: 9781441975713
International Series in Operations Research & Management Science ISBN: 9781441975713
Our focus in this chapter is on discrete center location problems. This class of problems involves locating one or more facilities on a network to service a set of demand points at known locations in such a way that every demand receives its service
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::48ddf273840d3074d1b3911c46faf793
https://hdl.handle.net/11693/38350
https://hdl.handle.net/11693/38350