We investigate in this paper the duality gap between quadratic knapsack problem and its Lagrangian dual or semidefinite programming relaxation. We characterize the duality gap by a distance measure from set {0, 1}<Superscript> n </Superscript> to certain polyhedral set and demonstrate that the duality gap can be reduced...</superscript>

This article describes how attractive structures are always correspond to objects of interest in human perception, thus extracting attractive structures is a fundamental problem in many image analysis tasks, which is of great practical importance. In this article, the authors propose a novel...

Current generalizations of the central ideas of single-objective branch-and-bound to the multiobjective setting do not seem to follow their train of thought all the way. The present paper complements the various suggestions for generalizations of partial lower bounds and of overall upper bounds...