default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Hatice Calik
![[0000-0002-9972-6199]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-9972-6199")
aka: Hatice Çalik
University of Lorraine, Nancy, France
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 22 matches
- 2024
- Hatice Çalik
, Tony Wauters, Greet Vanden Berghe:
The exam location problem: Mathematical formulations and variants. Comput. Oper. Res. 161: 106438 (2024) - Bryan Coulier, Hatice Çalik, Greet Vanden Berghe:
The constrained Bottleneck Spanning Tree Problem with upgrades. Discret. Appl. Math. 353: 12-28 (2024) - Jonas Tollenaere, Hatice Çalik, Tony Wauters:
Efficient use of collision detection for volume maximization problems. Eur. J. Oper. Res. 319(3): 967-982 (2024) - Yi-Hang Zhu, Gilles Callebaut, Hatice Çalik, Liesbet Van der Perre, François Rottenberg:
Correction: Zhu et al. Energy Efficient Access Point Placement for Distributed Massive MIMO. Network 2022, 2, 288-310. Network 4(3): 404 (2024) - 2023
- Hatice Çalik, Marc Juwet, Hande Yaman, Greet Vanden Berghe:
Cargo securing under multi-drop and axle weight constraints. Eur. J. Oper. Res. 307(1): 157-176 (2023) - Niels De Walsche, Carlo S. Sartori, Hatice Çalik:
A Radius-Based Approach for the Bi-Objective p-Center and p-Dispersion Problem. ICCL 2023: 533-549 - 2022
- Vinícius Gandra Martins Santos, Hatice Çalik, Túlio A. M. Toffolo, Marco Antonio Moreira de Carvalho, Greet Vanden Berghe:
The vessel swap-body routing problem. Eur. J. Oper. Res. 303(1): 354-369 (2022) - Yi-Hang Zhu, Gilles Callebaut, Hatice Çalik, Liesbet Van der Perre, François Rottenberg:
Energy Efficient Access Point Placement for Distributed Massive MIMO. Network 2(2): 288-310 (2022) - Vinícius Gandra, Carlo S. Sartori, Hatice Çalik, Pieter Smet:
Multi-depot periodic vehicle routing with variable visit patterns. GECCO Companion 2022: 2019-2026 - 2021
- Vinícius Gandra Martins Santos, Hatice Çalik, Tony Wauters, Túlio A. M. Toffolo, Marco Antonio Moreira de Carvalho, Greet Vanden Berghe:
The impact of loading restrictions on the two-echelon location routing problem. Comput. Ind. Eng. 160: 107609 (2021) - Hatice Çalik, Ammar Oulamara, Caroline Prodhon, Saïd Salhi:
The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach. Comput. Oper. Res. 131: 105251 (2021) - Consuelo Parreño-Torres, Hatice Çalik, Ramón Alvarez-Valdés, Rubén Ruiz:
Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm. Comput. Oper. Res. 133: 105383 (2021) - Everton Fernandes da Silva, Hatice Çalik, Wim Vancroonenburg, Aline Aparecida de Souza Leão, Tony Wauters:
Extracting maximal objects from three-dimensional solid materials. Comput. Oper. Res. 132: 105290 (2021) - Vinícius Gandra, Hatice Çalik, Tony Wauters, Greet Vanden Berghe:
A heuristic approach to feasibility verification for truck loading. GECCO Companion 2021: 1564-1569 - Carlo S. Sartori, Vinícius Gandra, Hatice Çalik, Pieter Smet:
Production Scheduling with Stock- and Staff-Related Restrictions. ICCL 2021: 142-162 - 2020
- Thomas Van den Bossche, Hatice Çalik, Evert-Jan Jacobs, Túlio A. M. Toffolo, Greet Vanden Berghe:
Truck scheduling in tank terminals. EURO J. Transp. Logist. 9(1): 100001 (2020) - Jan Christiaens, Hatice Çalik, Tony Wauters, Reshma Chirayil Chandrasekharan, Greet Vanden Berghe:
The prisoner transportation problem. Eur. J. Oper. Res. 284(3): 1058-1073 (2020) - 2017
- Hatice Calik, Markus Leitner, Martin Luipersbeck:
A Benders decomposition based framework for solving cable trench problems. Comput. Oper. Res. 81: 128-140 (2017) - Hatice Calik, Bernard Fortz:
Location of stations in a one-way electric car sharing system. ISCC 2017: 134-139 - 2013
- Hatice Çalik:
Exact solution Methodologies for the P-Center Problem under single and Multiple Allocation Strategies. Bilkent University, Ankara, Turkey, 2013 - Hatice Calik, Barbaros C. Tansel:
Double bound method for solving the p-center location problem. Comput. Oper. Res. 40(12): 2991-2999 (2013) - 2009
- Hatice Calik, Sibel A. Alumur, Bahar Yetis Kara, Oya Ekin Karasan:
A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Comput. Oper. Res. 36(12): 3088-3096 (2009)
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-11-01 11:50 CET from data curated 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:
