This paper presents and tests an effective optimization algorithm for clustering homogeneous data. The algorithm iteratively employs a subgradient method for determining lower bounds and a simple search procedure for determining upper bounds. The overall objective is to assign n objects to m...

Allocation of candidates to jobs is required in a situation where each candidate can only be allocated to certain jobs, and every job's "length" decreases as more candidates are allocated to it. The objective is to minimize the "ranked length vector," which is derived by arranging the...

Suppose N objects are hidden in m boxes where m is known and N is unknown; for example, suppose that we are hunting for defects (objects) in a system having several components (boxes). Let p = (p₁, p₂, ...) denote the probability distribution of N where p_n = P(N = n). The objects are...

This paper considers optimization problems with a nonlinear-additive objective function and a single linear constraint. Such models have numerous direct applications and serve as subproblems in procedures for more complex problems. Some important portfolio selection problems can be expressed in...

In Ohio, as well as several other states, annual unemployment compensation payments paid by a corporation can be minimized by solving a set partitioning problem which has all possible nonzero binary columns. The scenario, along with the model and an illustration are given. Some solution...