default search action
Halit Üster
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j31]Sung Ook Hwang, Halit Üster
, R. Canan Savaskan-Ebert:
Correction to: Reverse channel selection for commercial product returns under time-to-market and product value considerations. Ann. Oper. Res. 332(1): 1313 (2024) - [j30]Özgür Ünsal
Incorporating patients' appointment date preferences into decision-making: A simulation and optimization study. Comput. Ind. Eng. 196: 110521 (2024) - 2023
- [j29]Amin Ziaeifar, Halit Üster
Relay network design with direct shipment and multi-relay assignment. Ann. Oper. Res. 328(2): 1585-1614 (2023) - [j28]Qiaofeng Li
A Bilevel Model for Robust Network Design and Biomass Pricing Under Farmers' Risk Attitudes and Supply Uncertainty. Transp. Sci. 57(5): 1296-1320 (2023) - 2021
- [j27]Gökhan Memisoglu, Halit Üster:
Design of a biofuel supply network under stochastic and price-dependent biomass availability. IISE Trans. 53(8): 869-882 (2021) - [j26]Jyotirmoy Dalal
Robust Emergency Relief Supply Planning for Foreseen Disasters Under Evacuation-Side Uncertainty. Transp. Sci. 55(3): 791-813 (2021)
2010 – 2019
- 2018
- [j25]Jyotirmoy Dalal
Combining Worst Case and Average Case Considerations in an Integrated Emergency Response Network Design Problem. Transp. Sci. 52(1): 171-188 (2018) - [j24]Halit Üster
Biomass Logistics Network Design Under Price-Based Supply and Yield Uncertainty. Transp. Sci. 52(2): 474-492 (2018) - [j23]Saeed D. Manshadi
Wireless Charging of Electric Vehicles in Electricity and Transportation Networks. IEEE Trans. Smart Grid 9(5): 4503-4512 (2018) - 2017
- [j22]Halit Üster, Sung Ook Hwang:
Closed-Loop Supply Chain Network Design Under Demand and Return Uncertainty. Transp. Sci. 51(4): 1063-1085 (2017) - [j21]Panitan Kewcharoenwong, Halit Üster:
Relay Network Design with Capacity and Link-Imbalance Considerations: A Lagrangean Decomposition Algorithm and Analysis. Transp. Sci. 51(4): 1177-1195 (2017) - 2016
- [j20]Ahmed M. Marzouk, Erick Moreno-Centeno
A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem. INFORMS J. Comput. 28(4): 674-686 (2016) - [j19]Gökhan Memisoglu, Halit Üster:
Integrated Bioenergy Supply Chain Network Planning Problem. Transp. Sci. 50(1): 35-56 (2016) - 2014
- [j18]Sila Çetinkaya, Burcu Baris Keskin, Halit Üster:
Characterization of facility assignment costs for a location-inventory model under truckload distribution. J. Oper. Res. Soc. 65(9): 1371-1379 (2014) - [j17]Hui Lin, Halit Üster:
A parallel algorithm with enhancements via partial objective value cuts for cluster-based wireless sensor network design. J. Parallel Distributed Comput. 74(7): 2615-2625 (2014) - [j16]Panitan Kewcharoenwong, Halit Üster:
Benders decomposition algorithms for the fixed-charge relay network design in telecommunications. Telecommun. Syst. 56(4): 441-453 (2014) - [j15]Hui Lin, Halit Üster:
Exact and Heuristic Algorithms for Data-Gathering Cluster-Based Wireless Sensor Network Design Problem. IEEE/ACM Trans. Netw. 22(3): 903-916 (2014) - 2013
- [j14]I. Karakayali, Elif Akçali, Sila Çetinkaya, Halit Üster:
Capacitated replenishment and disposal planning for multiple products with resalable returns. Ann. Oper. Res. 203(1): 325-350 (2013) - 2011
- [j13]Halit Üster, Hui Lin:
Integrated topology control and routing in wireless sensor networks for prolonged network lifetime. Ad Hoc Networks 9(5): 835-851 (2011) - [j12]Halit Üster, Homarjun Agrahari:
A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations. Oper. Res. Lett. 39(2): 138-143 (2011) - [j11]Halit Üster, Panitan Kewcharoenwong:
Strategic Design and Analysis of a Relay Network in Truckload Transportation. Transp. Sci. 45(4): 505-523 (2011) - 2010
- [j10]Burcu Baris Keskin, Halit Üster, Sila Çetinkaya:
Integration of strategic and tactical decisions for vendor selection under capacity constraints. Comput. Oper. Res. 37(12): 2182-2191 (2010) - [j9]Halit Üster, Sarath K. S. Kumar:
Algorithms for the design of network topologies with balanced disjoint rings. J. Heuristics 16(1): 37-63 (2010)
2000 – 2009
- 2009
- [j8]Sila Çetinkaya, Halit Üster, Gopalakrishnan Easwaran, Burcu Baris Keskin:
An Integrated Outbound Logistics Model for Frito-Lay: Coordinating Aggregate-Level Production and Distribution Decisions. Interfaces 39(5): 460-475 (2009) - [j7]Elif Akçali, Sila Çetinkaya, Halit Üster:
Network design for reverse and closed-loop supply chains: An annotated bibliography of models and solution approaches. Networks 53(3): 231-248 (2009) - [j6]Gopalakrishnan Easwaran, Halit Üster:
Tabu Search and Benders Decomposition Approaches for a Capacitated Closed-Loop Supply Chain Network Design Problem. Transp. Sci. 43(3): 301-320 (2009) - 2007
- [j5]Burcu Baris Keskin, Halit Üster:
A scatter search-based heuristic to locate capacitated transshipment points. Comput. Oper. Res. 34(10): 3112-3125 (2007) - [j4]Burcu Baris Keskin, Halit Üster:
Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem. Eur. J. Oper. Res. 182(2): 663-682 (2007) - 2003
- [j3]Halit Üster, Robert F. Love:
Formulation of confidence intervals for estimated actual distances. Eur. J. Oper. Res. 151(3): 586-601 (2003) - 2001
- [j2]Halit Üster, Robert F. Love:
On the directional bias of the lbp-norm. Eur. J. Oper. Res. 128(3): 664-673 (2001) - [j1]Robert F. Love, Halit Üster:
A statistical comparison of three goodness-of-fit criteria used in modelling distances. Adv. Decis. Sci. 5(4): 235-251 (2001)
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-10-07 21:17 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: