Review of: Assignment Problems by Rainer Burkard, Mauro Dell'Amico, and Silvano Martello
نویسندگان
چکیده
منابع مشابه
Efficient algorithms and codes for k-cardinality assignment problems
Given a cost matrix W and a positive integer k, the k-cardinality assignment problem is to assign k rows to k columns so that the sum of the corresponding costs is a minimum. This generalization of the classical assignment problem is solvable in polynomial time, either by transformation to min-cost ow or through speciic algorithms. We consider the algorithm recently proposed by Dell'Amico and M...
متن کاملT 1 Assignment problems : The first fifty years
In 1955. H.W.Huhn published the Hungarian algorithm, the first polynomial-time algorithm for the assignment problem. In the next fifty years assignment problems attracted hundreds of researchers. Their studies accompanied and sometimes anticipated the development of Combinatorial Optimization, producing fundamental contributions to all algorithmic techniques in use nowadays. This talk is based ...
متن کاملQuadratic and Three Dimensional Assignments: An Annotated Bibliography
The amount of literature on quadratic assignment and related problems has already grown so much that overviewing it to determine the most relevant developments and the most recent trends becomes more and more diicult. This paper provides a collection of references on quadratic and three dimensional assignment problems together with brief annotations. We consider all aspects of the quadratic ass...
متن کاملLower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of values in a subset is minimized, and the number of values in each subset does not exceed the corresponding limit. The problem is related to scheduling and bin packing problems. We give combinatorial lower bounds, reduct...
متن کاملMinimizing the Sum of Weighted Completion Times with Unrestricted Weights
Given a set of tasks with associated processing times, deadlines and weights unrestricted in sign, we consider the problem of determining a task schedule on one machine by minimizing the sum of weighted completion times. The problem is NP-hard in the strong sense. We present a lower bound based on task splitting, an approximation algorithm, and two exact approaches, one based on branch-and-boun...
متن کامل