NP-Hardness of the Problem of Optimal Box Positioning

We consider the problem of finding a position of a <i>d</i>-dimensional box with given edge lengths that maximizes the number of enclosed points of the given finite set <inline-formula> <math display="inline"> <semantics> <mrow> <mi>P</mi> &l...

Full description

Bibliographic Details
Main Authors: Alexei V. Galatenko, Stepan A. Nersisyan, Dmitriy N. Zhuk
Format: Article
Published: MDPI AG 2019-08-01
Online Access: