Keywords: discrete dynamic optimization; branch and bound method; cutting planes; Vrv-principle; branching-reduction-union principle; comparison of algorithms; algorithmic performance analysis; computational efficiency