We present a branch and cut algorithm that yields in finite time, a globally ε-optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem.Expand

We present a generalized O-1 linear programming model for the complex nurse scheduling problem, which considers most of the characteristics of a real-world situation.Expand

A new reformulation of the linear mixed 0–1 programming problem into a linear bilevel programming one, which does not require the introduction of a large finite constant, is presented.Expand

The problem of determining a partition of a given set ofN entities intoM clusters such that the sum of the diameters of these clusters is minimum has been studied by Brucker (1978). He proved that it… Expand

An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., partitioning a given set of points from a Euclidean m-space into a given number of clusters in order to minimize the sum of squared distances from all points to the centroid of the cluster to which they belong.Expand