Gergely Kovács
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Gergely Kovács has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Béla Vizvári
Department of Industrial Engineering, Eastern Mediterranean University, Famagusta, Turkey
11 shared publications - Benedek Nagy
Department of Mathematics, Faculty of Arts and Sciences, Eastern Mediterranean University, Famagusta, Turkey
8 shared publications - Neşet Deniz Turgay
Department of Mathematics, Eastern Mediterranean University, Famagusta, Turkey
6 shared publications Benedek Nagy
Department of Mathematics, Faculty of Arts and Sciences Eastern Mediterranean University Famagusta Turkey
4 shared publicationsBéla Vizvári
Department of Industrial Engineering Eastern Mediterranean University Famagusta Turkey
4 shared publicationsGergely Stomfai
Peterhouse, University of Cambridge, Cambridge, United Kingdom
2 shared publications
Latest Publications
- 2 October 2025
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 34 (4) , 1-13
Weighted distance on the m-dimensional extensions of the face-centered cubic lattice
- 2 October 2025
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 34 (4) , 1-13
Weighted distance on the m-dimensional extensions of the face-centered cubic lattice
- Open Access
Hilbert basis in the face-centered cubic grid -- mathematical proofs
The Hilbert basis is fundamental in describing the structure of the integer points of a polyhedral cone. The face-centered cubic grid is one of the densest packing of the 3-dimensional space. The cycles of a grid satisfy the constraint set of a pointed, polyhedral cone which contains only non-negative integer vectors. The Hilbert basis of a grid gives the structure of the basic cycles in the grid. It is shown in this paper that the basic cycles of the FCC grid belong to 11 types. It is also discussed that how many elements are contained in the individual types. The proofs of the paper use geometric, combinatorial, algebraic, and operations research methods.
Open AccessHilbert basis in the face-centered cubic grid -- mathematical proofs
The Hilbert basis is fundamental in describing the structure of the integer points of a polyhedral cone. The face-centered cubic grid is one of the densest packing of the 3-dimensional space. The cycles of a grid satisfy the constraint set of a pointed, polyhedral cone which contains only non-negative integer vectors. The Hilbert basis of a grid gives the structure of the basic cycles in the grid. It is shown in this paper that the basic cycles of the FCC grid belong to 11 types. It is also discussed that how many elements are contained in the individual types. The proofs of the paper use geometric, combinatorial, algebraic, and operations research methods.
- Open Access
Determination of Temporary Hubs Locations Along a River in Case of Flood
Due to global climate change, the frequency and intensity of floods will be increasing in the decades to come. Under these conditions, there is an urgent need to develop such relatively simple and robust models and methods, which help the logistical preparatory and crisis management work in case of this natural disaster. In the crisis management phase, the integrated complex command centers and logistical hubs play an essential role. It is an open-ended question: how do we determine the optimal location of these hubs, and find an optimal compromise between their radius of supply and vulnerability? The current article presents a simple and fast method to determine the optimal position of hubs, minimizing their vulnerability, in cases when there is no chance to control the flood of the river (no dam), and in cases when there is a natural or artificial barrier, preventing the flow of water (dam scenario). Based on a system of equations, applying the Gumbel distribution of maximal water levels in various years, the article offers numerical examples to prove the simplicity and practical applicability of the method developed. This approach can supply a decision support system, based on AI. The paper concludes with policy implications.
Open AccessDetermination of Temporary Hubs Locations Along a River in Case of Flood
Due to global climate change, the frequency and intensity of floods will be increasing in the decades to come. Under these conditions, there is an urgent need to develop such relatively simple and robust models and methods, which help the logistical preparatory and crisis management work in case of this natural disaster. In the crisis management phase, the integrated complex command centers and logistical hubs play an essential role. It is an open-ended question: how do we determine the optimal location of these hubs, and find an optimal compromise between their radius of supply and vulnerability? The current article presents a simple and fast method to determine the optimal position of hubs, minimizing their vulnerability, in cases when there is no chance to control the flood of the river (no dam), and in cases when there is a natural or artificial barrier, preventing the flow of water (dam scenario). Based on a system of equations, applying the Gumbel distribution of maximal water levels in various years, the article offers numerical examples to prove the simplicity and practical applicability of the method developed. This approach can supply a decision support system, based on AI. The paper concludes with policy implications.
- Open Access
Open Loop Layout Optimization: Feasible Path Planning and Exact Door-to-Door Distance Calculation
The Open Loop Layout Problem (OLLP) seeks to position rectangular cells of varying dimensions on a plane without overlap, minimizing transportation costs computed as the flow-weighted sum of pairwise distances between cells. A key challenge in OLLP is to compute accurate inter-cell distances along feasible paths that avoid rectangle intersections. Existing approaches approximate inter-cell distances using centroids, a simplification that can ignore physical constraints, resulting in infeasible layouts or underestimated distances. This study proposes the first mathematical model that incorporates exact door-to-door distances and feasible paths under the Euclidean metric, with cell doors acting as pickup and delivery points. Feasible paths between doors must either follow rectangle edges as corridors or take direct, unobstructed routes. To address the NP-hardness of the problem, we present a metaheuristic framework with a novel encoding scheme that embeds exact path calculations. Experiments on standard benchmark instances confirm that our approach consistently outperforms existing methods, delivering superior solution quality and practical applicability.
Open AccessOpen Loop Layout Optimization: Feasible Path Planning and Exact Door-to-Door Distance Calculation
The Open Loop Layout Problem (OLLP) seeks to position rectangular cells of varying dimensions on a plane without overlap, minimizing transportation costs computed as the flow-weighted sum of pairwise distances between cells. A key challenge in OLLP is to compute accurate inter-cell distances along feasible paths that avoid rectangle intersections. Existing approaches approximate inter-cell distances using centroids, a simplification that can ignore physical constraints, resulting in infeasible layouts or underestimated distances. This study proposes the first mathematical model that incorporates exact door-to-door distances and feasible paths under the Euclidean metric, with cell doors acting as pickup and delivery points. Feasible paths between doors must either follow rectangle edges as corridors or take direct, unobstructed routes. To address the NP-hardness of the problem, we present a metaheuristic framework with a novel encoding scheme that embeds exact path calculations. Experiments on standard benchmark instances confirm that our approach consistently outperforms existing methods, delivering superior solution quality and practical applicability.
- 19 March 2025
- Published by Wiley in Transactions in GIS
- Vol. 29 (2)
Minimal Path‐Generated Distances on the Trihexagonal Grid Having Four Neighborhoods
Grids are more general geometric objects than discrete subgroups. However, they are still very regular. Grids are applied in crystallography, chemistry, digital image processing, computer graphics, networking, just to mention a few. Recently, distances of the points pixels of grids based on minimal path have been developed. The trihexagonal grid has three types of pixels: hexagons and two oppositely oriented triangles. Four types of neighborhood relations are considered on the grid. The first type of neighborhood contains the side‐neighbors that are always a hexagon and a triangle. There are two semi‐neighbor relations: the second type of neighborhood describes the pairs of closest hexagons, while the third type of neighborhood refers to the closest pairs of differently oriented triangles. Finally, the extended neighborhood relates to the closest same‐shaped triangles, and this is the fourth type of neighborhood we have defined. Based on the four types of neighbor relations, four weights are used. The main result of the paper is that formulas are provided giving the minimal path between any two pixels. The length of the minimal path depends on the coordinate differences of the pixels, the relation of the weights, and the types of the two pixels. Formulas for all possible cases are given (with some usual restrictions, e.g., a step between side neighbor pixels cannot be longer, i.e., with larger weight than other steps). Some properties of these distances, including metricity, are also analyzed.
- 19 March 2025
- Published by Wiley in Transactions in GIS
- Vol. 29 (2)
Minimal Path‐Generated Distances on the Trihexagonal Grid Having Four Neighborhoods
Grids are more general geometric objects than discrete subgroups. However, they are still very regular. Grids are applied in crystallography, chemistry, digital image processing, computer graphics, networking, just to mention a few. Recently, distances of the points pixels of grids based on minimal path have been developed. The trihexagonal grid has three types of pixels: hexagons and two oppositely oriented triangles. Four types of neighborhood relations are considered on the grid. The first type of neighborhood contains the side‐neighbors that are always a hexagon and a triangle. There are two semi‐neighbor relations: the second type of neighborhood describes the pairs of closest hexagons, while the third type of neighborhood refers to the closest pairs of differently oriented triangles. Finally, the extended neighborhood relates to the closest same‐shaped triangles, and this is the fourth type of neighborhood we have defined. Based on the four types of neighbor relations, four weights are used. The main result of the paper is that formulas are provided giving the minimal path between any two pixels. The length of the minimal path depends on the coordinate differences of the pixels, the relation of the weights, and the types of the two pixels. Formulas for all possible cases are given (with some usual restrictions, e.g., a step between side neighbor pixels cannot be longer, i.e., with larger weight than other steps). Some properties of these distances, including metricity, are also analyzed.
- Open Access
Variability in Modeling the Cyclic Scheduling of an FMC Depending on the Underlying TSP Models
Flexible robotic cells are utilized to produce standardized products at a high speed production rate, and to set up the production floors based on rapid operating environment changes. In FRC, there are a number of computer numerical control machines, an input buffer, an output buffer, and a robot. The input and output buffers contain unprocessed and finished products, respectively, whereas the robot performs the loading and unloading activities and transports the items among buffers and machines. The system repeats a cyclic schedule in its run and the cycle time depends on the order of robot activities. In order to maximize the efficiency of the system, the order of the robot activities yielding the minimum cycle time should be determined. The aim of this research is to find novel exact models to solve this cycling scheduling problem. These types of problems have tight relations with traveling salesman problem. In this study, four main modeling approaches of the TSP, such as Dantzig-Fulkerson-Johnson approach, Miller-Tucker-Zemlin approach, Vajda's n-step approach, and the network flow approach are studied. Only the DFJ approach cannot be adapted to the scheduling problem. The three other approaches are adapted successfully. Similarities and differences are discussed by using several numerical examples.
Open AccessVariability in Modeling the Cyclic Scheduling of an FMC Depending on the Underlying TSP Models
Flexible robotic cells are utilized to produce standardized products at a high speed production rate, and to set up the production floors based on rapid operating environment changes. In FRC, there are a number of computer numerical control machines, an input buffer, an output buffer, and a robot. The input and output buffers contain unprocessed and finished products, respectively, whereas the robot performs the loading and unloading activities and transports the items among buffers and machines. The system repeats a cyclic schedule in its run and the cycle time depends on the order of robot activities. In order to maximize the efficiency of the system, the order of the robot activities yielding the minimum cycle time should be determined. The aim of this research is to find novel exact models to solve this cycling scheduling problem. These types of problems have tight relations with traveling salesman problem. In this study, four main modeling approaches of the TSP, such as Dantzig-Fulkerson-Johnson approach, Miller-Tucker-Zemlin approach, Vajda's n-step approach, and the network flow approach are studied. Only the DFJ approach cannot be adapted to the scheduling problem. The three other approaches are adapted successfully. Similarities and differences are discussed by using several numerical examples.
- 25 August 2023
- Published by International Union of Crystallography (IUCr) in Acta Crystallographica Section A Foundations and Advances
- Vol. 79 (5) , 452-462
Distances in the face-centered cubic crystalline structure applying operational research
The f.c.c. (face-centered cubic) grid is the structure of many crystals and minerals. It consists of four cubic lattices. It is supposed that there are two types of steps between two grid points. It is possible to step to one of the nearest neighbors of the same cubic lattice (type 1) or to step to one of the nearest neighbors of another cubic lattice (type 2). Steps belonging to the same type have the same length (weight). However, the two types have different lengths and thus may have different weights. This paper discusses the minimal path between any two points of the f.c.c. grid. The minimal paths are explicitly given, i.e. to obtain a minimal path one is required to perform only O(1) computations. The mathematical problem can be the model of different spreading phenomena in crystals having the f.c.c. structure.
- 25 August 2023
- Published by International Union of Crystallography (IUCr) in Acta Crystallographica Section A Foundations and Advances
- Vol. 79 (5) , 452-462
Distances in the face-centered cubic crystalline structure applying operational research
The f.c.c. (face-centered cubic) grid is the structure of many crystals and minerals. It consists of four cubic lattices. It is supposed that there are two types of steps between two grid points. It is possible to step to one of the nearest neighbors of the same cubic lattice (type 1) or to step to one of the nearest neighbors of another cubic lattice (type 2). Steps belonging to the same type have the same length (weight). However, the two types have different lengths and thus may have different weights. This paper discusses the minimal path between any two points of the f.c.c. grid. The minimal paths are explicitly given, i.e. to obtain a minimal path one is required to perform only O(1) computations. The mathematical problem can be the model of different spreading phenomena in crystals having the f.c.c. structure.
- Open Access
- 21 April 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-9
On Chamfer Distances on the Square and Body-Centered Cubic Grids: An Operational Research Approach
Linear programming is used to solve optimization problems. Thus, finding a shortest path in a grid is a good target to apply linear programming. In this paper, specific bipartite grids, the square and the body-centered cubic grids are studied. The former is represented as a “diagonal square grid” having points with pairs of either even or pairs of odd coordinates (highlighting the bipartite feature). Therefore, a straightforward generalization of the representation describes the body-centered cubic grid in 3D. We use chamfer paths and chamfer distances in these grids; therefore, weights for the steps between the closest neighbors and steps between the closest same type points are fixed, and depending on the weights, various paths could be the shortest one. The vectors of the various neighbors form a basis if they are independent, and their number is the same as the dimension of the space studied. Depending on the relation of the weights, various bases could give the optimal solution and various steps are used in the shortest paths. This operational research approach determines the optimal paths as basic feasible solutions of a linear programming problem. A directed graph is given containing the feasible bases as nodes and arcs with conditions on the used weights such that the simplex method may step from one feasible basis to another one. Thus, the optimal bases can be determined, and they are summarized in two theorems. If the optimal solution is not integer, then the Gomory cut is applied and the integer optimal solution is reached after only one Gomory iteration. Chamfer distances are frequently used in image processing and analysis as well as graphics-related subjects. The body-centered cubic grid, which is well-known in solid state physics, material science, and crystallography, has various applications in imaging and graphics since less samples are needed to represent the signal in the same quality than on the cubic grid. Moreover, the body-centered cubic grid has also a topological advantage over the cubic grid, namely, the neighbor Voronoi cells always share a full face.
- 21 April 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-9
Open AccessOn Chamfer Distances on the Square and Body-Centered Cubic Grids: An Operational Research Approach
Linear programming is used to solve optimization problems. Thus, finding a shortest path in a grid is a good target to apply linear programming. In this paper, specific bipartite grids, the square and the body-centered cubic grids are studied. The former is represented as a “diagonal square grid” having points with pairs of either even or pairs of odd coordinates (highlighting the bipartite feature). Therefore, a straightforward generalization of the representation describes the body-centered cubic grid in 3D. We use chamfer paths and chamfer distances in these grids; therefore, weights for the steps between the closest neighbors and steps between the closest same type points are fixed, and depending on the weights, various paths could be the shortest one. The vectors of the various neighbors form a basis if they are independent, and their number is the same as the dimension of the space studied. Depending on the relation of the weights, various bases could give the optimal solution and various steps are used in the shortest paths. This operational research approach determines the optimal paths as basic feasible solutions of a linear programming problem. A directed graph is given containing the feasible bases as nodes and arcs with conditions on the used weights such that the simplex method may step from one feasible basis to another one. Thus, the optimal bases can be determined, and they are summarized in two theorems. If the optimal solution is not integer, then the Gomory cut is applied and the integer optimal solution is reached after only one Gomory iteration. Chamfer distances are frequently used in image processing and analysis as well as graphics-related subjects. The body-centered cubic grid, which is well-known in solid state physics, material science, and crystallography, has various applications in imaging and graphics since less samples are needed to represent the signal in the same quality than on the cubic grid. Moreover, the body-centered cubic grid has also a topological advantage over the cubic grid, namely, the neighbor Voronoi cells always share a full face.
- 12 February 2021
- Published by Elsevier in Pattern Recognition Letters
- Vol. 145, 141-146
Distance on the Cairo pattern
- 12 February 2021
- Published by Elsevier in Pattern Recognition Letters
- Vol. 145, 141-146
Distance on the Cairo pattern
- Open Access
- 20 January 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (3) , 208
Discrete Optimization: The Case of Generalized BCC Lattice
Recently, operations research, especially linear integer-programming, is used in various grids to find optimal paths and, based on that, digital distance. The 4 and higher-dimensional body-centered-cubic grids is the nD () equivalent of the 3D body-centered cubic grid, a well-known grid from solid state physics. These grids consist of integer points such that the parity of all coordinates are the same: either all coordinates are odd or even. A popular type digital distance, the chamfer distance, is used which is based on chamfer paths. There are two types of neighbors (closest same parity and closest different parity point-pairs), and the two weights for the steps between the neighbors are fixed. Finding the minimal path between two points is equivalent to an integer-programming problem. First, we solve its linear programming relaxation. The optimal path is found if this solution is integer-valued. Otherwise, the Gomory-cut is applied to obtain the integer-programming optimum. Using the special properties of the optimization problem, an optimal solution is determined for all cases of positive weights. The geometry of the paths are described by the Hilbert basis of the non-negative part of the kernel space of matrix of steps.- 20 January 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (3) , 208
Open AccessDiscrete Optimization: The Case of Generalized BCC Lattice
Recently, operations research, especially linear integer-programming, is used in various grids to find optimal paths and, based on that, digital distance. The 4 and higher-dimensional body-centered-cubic grids is the nD () equivalent of the 3D body-centered cubic grid, a well-known grid from solid state physics. These grids consist of integer points such that the parity of all coordinates are the same: either all coordinates are odd or even. A popular type digital distance, the chamfer distance, is used which is based on chamfer paths. There are two types of neighbors (closest same parity and closest different parity point-pairs), and the two weights for the steps between the neighbors are fixed. Finding the minimal path between two points is equivalent to an integer-programming problem. First, we solve its linear programming relaxation. The optimal path is found if this solution is integer-valued. Otherwise, the Gomory-cut is applied to obtain the integer-programming optimum. Using the special properties of the optimization problem, an optimal solution is determined for all cases of positive weights. The geometry of the paths are described by the Hilbert basis of the non-negative part of the kernel space of matrix of steps.