The face-centered cubic lattice is one of the most common and most known three-dimensional structure appearing in the nature. Its higher dimensional extensions are interesting not only from algebraic and combinatorial points of view, but also in geometry, in physics and in material science. In this paper, digital, i.e., path-based, distances are computed in the m -dimensional generalizations of this face-centered cubic lattice. In the graphs of these m -dimensional lattices, the two usual types of neighborhood relations of the face-centered lattice are also used implying the use of two different weights. A method based on operational research is used to identify some shortest weighted paths and thus, to derive formula for the weighted distance depending on the weights.
Turgay, Neşet Deniz, Nagy, Benedek, Kovács, Gergely et al. Weighted distance on the m-dimensional extensions of the face-centered cubic lattice. // Central European Journal of Operations Research. – 2026. – DOI: 10.1007/s10100-025-00998-5. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10100-025-00998-5
Turgay, Neşet Deniz, Nagy, Benedek, Kovács, Gergely, Vizvári, & Béla (2026). Weighted distance on the m-dimensional extensions of the face-centered cubic lattice. Central European Journal of Operations Research. https://doi.org/10.1007/s10100-025-00998-5
Turgay, et al. “Weighted distance on the m-dimensional extensions of the face-centered cubic lattice.” Central European Journal of Operations Research, 2026. doi:10.1007/s10100-025-00998-5.
@article{Turgay2026,
title = {Weighted distance on the m-dimensional extensions of the face-centered cubic lattice},
author = {Turgay and Deniz, Neşet and Nagy and Benedek and Kovács and Gergely and Vizvári and Béla},
journal = {Central European Journal of Operations Research},
year = {2026},
doi = {10.1007/s10100-025-00998-5},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10100-025-00998-5}
}
In this paper, we consider cost-sharing problems defined on rooted trees. We refer to these problems as cost-tree problems and to the induced transferable utility cooperative games as irrigation games. We introduce a formal notion of...
In this paper, we focus on nonlinear programming problems with cardinality constraints that restrict the number of nonzero components of the decision vector. We start with a straightforward mixed-integer programming reformulation....
Portfolio selection is a critical issue in financial management under uncertainty. In this paper, we propose a complex approach for portfolio selection with quantile return approximation. In particular, we propose a practical workflow...
The transcendental logarithmic (translog) production function is recognised as a flexible functional form for modelling production processes. It accommodates varying elasticities of input substitution and diverse types of...
This study investigates mothership-drone route determination using two optimization approaches: a Mixed Integer Linear Programming (MILP) model based on a discrete hexagonal grid, and a Mixed Integer Nonlinear Programming (MINLP) model...