default search action
Haldun Süral
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j34]Serhat Saylam
, Melih Çelik
Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses. Eur. J. Oper. Res. 313(1): 225-240 (2024) - 2023
- [j33]Arsham Atashi Khoei
Energy minimizing order picker forklift routing problem. Eur. J. Oper. Res. 307(2): 604-626 (2023) - [j32]Serhat Saylam
The min-max order picking problem in synchronised dynamic zone-picking systems. Int. J. Prod. Res. 61(7): 2086-2104 (2023) - 2022
- [j31]Melih Çelik
Inventory routing in a warehouse: The storage replenishment routing problem. Eur. J. Oper. Res. 301(3): 1117-1132 (2022) - [j30]Oguz Solyali
An Effective Matheuristic for the Multivehicle Inventory Routing Problem. Transp. Sci. 56(4): 1044-1057 (2022) - 2020
- [j29]Arsham Atashi Khoei
Multi-facility green Weber problem. Comput. Oper. Res. 113 (2020)
2010 – 2019
- 2019
- [j28]Hüseyin Güden, Haldun Süral:
The dynamic p-median problem with mobile facilities. Comput. Ind. Eng. 135: 615-627 (2019) - [j27]Melih Çelik
Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic. Int. J. Prod. Res. 57(3): 888-906 (2019) - 2018
- [j26]Mohammad Saleh Farham, Haldun Süral, Cem Iyigun:
A column generation approach for the location-routing problem with time windows. Comput. Oper. Res. 90: 249-263 (2018) - [j25]Mohammad Saleh Farham, Haldun Süral
Generalization of the restricted planar location problems: Unified metaheuristic algorithms. Comput. Oper. Res. 99: 48-66 (2018) - [j24]Tiffany Bayley
A hybrid Benders approach for coordinated capacitated lot-sizing of multiple product families with set-up times. Int. J. Prod. Res. 56(3): 1326-1344 (2018) - 2017
- [j23]Oguz Solyali
A multi-phase heuristic for the production routing problem. Comput. Oper. Res. 87: 114-124 (2017) - [j22]Arsham Atashi Khoei
Time-dependent green Weber problem. Comput. Oper. Res. 88: 316-323 (2017) - [j21]Hüseyin Güden, Haldun Süral
A polynomial algorithm for the earthwork allocation problem with borrow and waste site selection. J. Oper. Res. Soc. 68(9): 1085-1093 (2017) - 2015
- [j20]Mohammad Saleh Farham, Haldun Süral
The Weber problem in congested regions with entry and exit points. Comput. Oper. Res. 62: 177-183 (2015) - 2012
- [j19]Oguz Solyali
The one-warehouse multi-retailer problem: reformulation, classification, and computational results. Ann. Oper. Res. 196(1): 517-541 (2012) - 2011
- [j18]Oguz Solyali
A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem. Transp. Sci. 45(3): 335-345 (2011) - 2010
- [j17]Selim Çetiner, Canan Sepil, Haldun Süral
Hubbing and routing in postal delivery systems. Ann. Oper. Res. 181(1): 109-124 (2010) - [j16]Murat Köksalan, Selin Özpeynirci, Haldun Süral:
Case Article - Forecasting Beer Demand at Anadolu Efes. INFORMS Trans. Educ. 10(3): 140-141 (2010) - [j15]Murat Köksalan, Selin Özpeynirci, Haldun Süral:
Case - Forecasting Beer Demand at Anadolu Efes. INFORMS Trans. Educ. 10(3): 142-145 (2010) - [j14]Murat Köksalan, Selin Özpeynirci, Haldun Süral:
Teaching Note - Forecasting Beer Demand at Anadolu Efes. INFORMS Trans. Educ. 10(3): 146-155 (2010) - [c1]Volkan Çinar, Temel Öncan, Haldun Süral:
A Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery Using Depot Removal and Insertion Moves. EvoApplications (2) 2010: 431-440
2000 – 2009
- 2009
- [j13]Haldun Süral
Lagrangean relaxation based heuristics for lot sizing with setup times. Eur. J. Oper. Res. 194(1): 51-63 (2009) - 2008
- [j12]Oguz Solyali
A single supplier-single retailer system with an order-up-to level inventory policy. Oper. Res. Lett. 36(5): 543-546 (2008) - [j11]Meltem Denizel, Fatma Tevhide Altekin
Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times. OR Spectr. 30(4): 773-785 (2008) - 2007
- [j10]Güvenç Sahin
Locational analysis for regionalization of Turkish Red Crescent blood services. Comput. Oper. Res. 34(3): 692-704 (2007) - [j9]Güvenç Sahin
A review of hierarchical facility location models. Comput. Oper. Res. 34(8): 2310-2331 (2007) - [j8]Ö Özpeynirci, Haldun Süral
Comment on Berman and Huang (2004): Minisum collection depots location problem reduces to the p-median problem. J. Oper. Res. Soc. 58(10): 1395-1396 (2007) - 2006
- [j7]Meltem Denizel, Haldun Süral
On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times. J. Oper. Res. Soc. 57(4): 389-399 (2006) - 2005
- [j6]Ayse Koçlar, Haldun Süral
A note on "The general lot sizing and scheduling problem". OR Spectr. 27(1): 145-146 (2005) - [j5]Y. Murat Erten, Refik Güllü, Haldun Süral
A Knapsack Model for Bandwidth Management of Prerecorded Multiple MPEG Video Sources. Telecommun. Syst. 28(1): 101-116 (2005) - 2003
- [j4]Haldun Süral
The single-vehicle routing problem with unrestricted backhauls. Networks 41(3): 127-136 (2003)
1990 – 1999
- 1999
- [j3]Murat Köksalan, Haldun Süral:
Efes Beverage Group Makes Location and Distribution Decisions for Its Malt Plants. Interfaces 29(2): 89-103 (1999) - [j2]Ashish Tripathy, Haldun Süral, Yigal Gerchak:
Multidimensional assortment problem with an application. Networks 33(3): 239-245 (1999) - 1992
- [j1]Haldun Süral
Scheduling unit-time tasks in renewable resource constrained flowshops. ZOR Methods Model. Oper. Res. 36(6): 497-516 (1992)
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-25 05: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
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: