List All News Articles

Department of Mathematics - Research Spotlight

Research Article: “Discrete Optimization: The Case of Generalized BCC Lattice” - Mathematics, MDPI — 18 January 2021
Authors: Prof. Dr. BENEDEK NAGY, Dr. NEŞET DENİZ TURGAY, Prof. Dr. BÉLA VIZVÁRI, Prof. Dr. GERGELY KOVÁCS, GERGELY STOMFAI
“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 (n ≥ 4) 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.”