Hatice Calik

According to our database, Hatice Calik authored at least 22 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

The exam location problem: Mathematical formulations and variants.

Hatice Çalik, Tony Wauters, Greet Vanden Berghe

Comput. Oper. Res., January, 2024

Correction: Zhu et al. Energy Efficient Access Point Placement for Distributed Massive MIMO. Network 2022, 2, 288-310.

Yi-Hang Zhu, Gilles Callebaut, Hatice Çalik, Liesbet Van der Perre, François Rottenberg

Network, 2024

Efficient use of collision detection for volume maximization problems.

Jonas Tollenaere, Hatice Çalik, Tony Wauters

Eur. J. Oper. Res., 2024

The constrained Bottleneck Spanning Tree Problem with upgrades.

Bryan Coulier, Hatice Çalik, Greet Vanden Berghe

Discret. Appl. Math., 2024

2023

Cargo securing under multi-drop and axle weight constraints.

Hatice Çalik, Marc Juwet, Hande Yaman, Greet Vanden Berghe

Eur. J. Oper. Res., May, 2023

A Radius-Based Approach for the Bi-Objective p-Center and p-Dispersion Problem.

Niels De Walsche, Carlo S. Sartori, Hatice Çalik

Proceedings of the Computational Logistics - 14th International Conference, 2023

2022

Energy Efficient Access Point Placement for Distributed Massive MIMO.

Yi-Hang Zhu, Gilles Callebaut, Hatice Çalik, Liesbet Van der Perre, François Rottenberg

Network, 2022

The vessel swap-body routing problem.

Vinícius Gandra Martins Santos, Hatice Çalik, Túlio A. M. Toffolo, Marco Antonio Moreira de Carvalho, Greet Vanden Berghe

Eur. J. Oper. Res., 2022

Multi-depot periodic vehicle routing with variable visit patterns.

Vinícius Gandra, Carlo S. Sartori, Hatice Çalik, Pieter Smet

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

2021

Extracting maximal objects from three-dimensional solid materials.

Everton Fernandes da Silva, Hatice Çalik, Wim Vancroonenburg, Aline Aparecida de Souza Leão, Tony Wauters

Comput. Oper. Res., 2021

Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm.

Consuelo Parreño-Torres, Hatice Çalik, Ramón Alvarez-Valdés, Rubén Ruiz

Comput. Oper. Res., 2021

The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach.

Hatice Çalik, Ammar Oulamara, Caroline Prodhon, Saïd Salhi

Comput. Oper. Res., 2021

The impact of loading restrictions on the two-echelon location routing problem.

Vinícius Gandra Martins Santos, Hatice Çalik, Tony Wauters, Túlio A. M. Toffolo, Marco Antonio Moreira de Carvalho, Greet Vanden Berghe

Comput. Ind. Eng., 2021

Production Scheduling with Stock- and Staff-Related Restrictions.

Carlo S. Sartori, Vinícius Gandra, Hatice Çalik, Pieter Smet

Proceedings of the Computational Logistics - 12th International Conference, 2021

A heuristic approach to feasibility verification for truck loading.

Vinícius Gandra, Hatice Çalik, Tony Wauters, Greet Vanden Berghe

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020

The prisoner transportation problem.

Jan Christiaens, Hatice Çalik, Tony Wauters, Reshma Chirayil Chandrasekharan, Greet Vanden Berghe

Eur. J. Oper. Res., 2020

Truck scheduling in tank terminals.

Thomas Van den Bossche, Hatice Çalik, Evert-Jan Jacobs, Túlio A. M. Toffolo, Greet Vanden Berghe

EURO J. Transp. Logist., 2020

2017

A Benders decomposition based framework for solving cable trench problems.

Hatice Calik, Markus Leitner, Martin Luipersbeck

Comput. Oper. Res., 2017

Location of stations in a one-way electric car sharing system.

Hatice Calik, Bernard Fortz

Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

2013

Exact solution Methodologies for the P-Center Problem under single and Multiple Allocation Strategies.

Hatice Çalik

PhD thesis, 2013

Double bound method for solving the p-center location problem.

Hatice Calik, Barbaros C. Tansel

Comput. Oper. Res., 2013

2009

A tabu-search based heuristic for the hub covering problem over incomplete hub networks.

Hatice Calik, Sibel A. Alumur, Bahar Yetis Kara, Oya Ekin Karasan

Comput. Oper. Res., 2009