Article

A New Algorithm for k-Cardinality Assignment Problem

Authors:
To read the full-text of this research, you can request a copy directly from the author.

Abstract

The k-cardinality assignment problem is a generalization of the assignment problem in which a cost matrix and a positive integer k are given and one wants to assign k rows to k columns so that the sum of the corresponding costs is a minimum. M. Dell' Amico and S. Martello are the first who considered the k-cardinality assignment problem (1997). In 2001, M. Dell' Amico, A. Lodi and S. Martello considered further specialized efficient algorithm. The object of this paper is to show the k-cardinality assignment problem is solvable by transforming it into a classical assignment problem, and obtain a new algorithm.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the author.

... Guo-Zhong Bai proposed transforming the k-AP into a LAP by modifying the cost matrix and then solving the problem using the Kuhn-Munkres algorithm (Bai 2009). The modified cost matrix (C) is created by adding n −k rows and m −k columns to the original cost matrix (C). ...
Article
Full-text available
In multi-objective optimization problems (MOPs), we aim to simultaneously find the maximum or minimum values of two or more (often conflicting) objective functions. MOPs are often found in real-world applications and, consequently, many methods have been proposed to solve them. Multi-Objective Evolutionary Algorithms (MOEAs) are popular techniques to solve MOPs due to their ease of use and their generality. Assessing the performance of MOEAs has become increasingly important due to the high number of MOEAs that have been developed in recent years. This work presents a novel framework for creating quality indicators using the linear assignment problem. In addition, we introduce two novel quality indicators generated using this framework and present examples to validate their performance. Furthermore, we present a novel algorithm called MOEA-kAP that can incorporate any indicator generated using our proposed framework as a density estimator. Our experimental results show that MOEA-kAP outperforms state-of-the-art algorithms.
... The k-cardinality Linear Assignment Problem, or k-LAP (see e.g. [17][18][19][20][21][22][23][24]), asks for finding an optimal (here optimal is maximal) weight of a matching (independent edge set) of cardinality k, where k ≤ n. That is, we are looking for a set M k ⊆ E of k pairwise non-adjacent edges in K n,n that is of maximal total weight: 2. If the problem refers to sets U and V of different cardinalities n and m < n, respectively, then we can always introduce n − m spurious (dummy) vertices and n(n − m) spurious edges of weights −∞ (+∞ in the minimal assignment case) so that U and V become of equal cardinality. ...
Article
Full-text available
The k -cardinality assignment ( k -assignment, for short) problem asks for finding a minimal (maximal) weight of a matching of cardinality k in a weighted bipartite graph Kn,nK_{n,n} K n , n , knk \le n k ≤ n . Here we are interested in computing the sequence of all k -assignments, k=1,,nk=1,\ldots ,n k = 1 , … , n . By applying the algorithm of Gassner and Klinz (2010) for the parametric assignment problem one can compute in time O(n3){\mathcal {O}}(n^3) O ( n 3 ) the set of k -assignments for those integers knk \le n k ≤ n which refer to essential terms of the full characteristic maxpolynomial χˉW(x){\bar{\chi }}_{W}(x) χ ¯ W ( x ) of the corresponding max-plus weight matrix W . We show that χˉW(x){\bar{\chi }}_{W}(x) χ ¯ W ( x ) is in full canonical form, which implies that the remaining k -assignments refer to semi-essential terms of χˉW(x){\bar{\chi }}_{W}(x) χ ¯ W ( x ) . This property enables us to efficiently compute in time O(n2){\mathcal {O}}(n^2) O ( n 2 ) all the remaining k -assignments out of the already computed essential k -assignments. It follows that time complexity for computing the sequence of all k -cardinality assignments is O(n3){\mathcal {O}}(n^3) O ( n 3 ) , which is the best known time for this problem.
... The k-cardinality assignment allows the selection of k IMFs for each set that have to be assigned, with k < minimum number of IMFs. The k-cardinality assignment problem was shown to be resolvable by transforming it into an assignment problem [17] . Thus, the KMA approach can also be used to solve the k-cardinality assignment after the required transformation. ...
Article
Full-text available
We address the correspondence problem which arises when applying empirical mode decomposition (EMD) to multi-trial and multi-subject data. EMD decomposes a signal into a set of narrow-band components named intrinsic mode functions (IMFs). The number of IMFs and their signal properties can be different between trials, channels and subjects. In order to assign IMFs with similar characteristics to each other, we compare two assignment methods, unbalanced assignment and k-cardinality assignment and two clustering algorithms, namely hierarchical clustering and density-based spatial clustering of applications with noise based on heart rate variability data of children with temporal lobe epilepsy.
Article
The Kidney Exchange Problem (KEP) is a combinatorial optimization problem and has attracted the attention from the community of integer programming/combinatorial optimisation in the past few years. Defined on a directed graph, the KEP has two variations: one concerns cycles only, and the other, cycles as well as chains on the same graph. We call the former a Cardinality Constrained Multi-cycle Problem (CCMcP) and the latter a Cardinality Constrained Cycles and Chains Problem (CCCCP). The cardinality for cycles is restricted in both CCMcP and CCCCP. As for chains, some studies in the literature considered cardinality restrictions, whereas others did not. The CCMcP can be viewed as an Asymmetric Travelling Salesman Problem that does allow subtours, however these subtours are constrained by cardinality, and that it is not necessary to visit all vertices. In existing literature of the KEP, the cardinality constraint for cycles is usually considered to be small (to the best of our knowledge, no more than six). In a CCCCP, each vertex on the directed graph can be included in at most one cycle or chain, but not both. The CCMcP and the CCCCP are interesting and challenging combinatorial optimization problems in their own rights, particularly due to their similarities to some travelling salesman- and vehicle routing-family of problems. In this paper, our main focus is to review the existing mathematical programming models and solution methods in the literature, analyse the performance of these models, and identify future research directions. Further, we propose a polynomial-sized and an exponential-sized mixed-integer linear programming model, discuss a number of stronger constraints for cardinality-infeasible-cycle elimination for the latter, and present some preliminary numerical results.
Article
Full-text available
This paper establishes a new assignment problem called the time limit assignment problem (TLAP) which pursues the best overall efficiency only if all tasks have been completed in time or very close to the deadline. The time limit assignment problem contains one discrete goal constraint, and therefore it is a special goal programming problem. This paper provides a mathematical model for such a time limit assignment problem and introduces a method to find its optimal solutions and the deviation of the optimal solution to the warning time. We also provide an example that illustrates how to solve the time limit assignment problem.
Article
Full-text available
"August 1988. Revised: December, 1988."
Article
Full-text available
A time-slot assignment procedure using the maximum-weight matching algorithm is proposed and investigated. In contrast with previous methods, based on the maximum-cardinality matching, the proposed procedure allows the inclusion of known heuristics in a more direct manner. Computer simulation gives evidence of efficiency improvements by using this approach
Book
0 Introduction.- I: Linear Programming.- 1 Geometric Linear Programming.- 0. Introduction.- 1. Two Examples: Profit Maximization and Cost Minimization.- 2. Canonical Forms for Linear Programming Problems.- 3. Polyhedral Convex Sets.- 4. The Two Examples Revisited.- 5. A Geometric Method for Linear Programming.- 6. Concluding Remarks.- Exercises.- 2 The Simplex Algorithm.- 0. Introduction.- 1. Canonical Slack Forms for Linear Programming Problems Tucker Tableaus.- 2. An Example: Profit Maximization.- 3. The Pivot Transformation.- 4. An Example: Cost Minimization.- 5. The Simplex Algorithm for Maximum Basic Feasible Tableaus.- 6. The Simplex Algorithm for Maximum Tableaus.- 7. Negative Transposition The Simplex Algorithm for Minimum Tableaus.- 8. Cycling.- 9. Concluding Remarks.- Exercises.- 3 Noncanonical Linear Programming Problems.- 0. Introduction.- 1. Unconstrained Variables.- 2. Equations of Constraint.- 3. Concluding Remarks.- Exercises.- 4 Duality Theory.- 0. Introduction.- 1. Duality in Canonical Tableaus.- 2. The Dual Simplex Algorithm.- 3. Matrix Formulation of Canonical Tableaus.- 4. The Duality Equation.- 5. The Duality Theorem.- 6. Duality in Noncanonical Tableaus.- 7. Concluding Remarks.- Exercises.- II: Applications.- 5 Matrix Games.- 0. Introduction.- 1. An Example Two-Person Zero-Sum Matrix Games.- 2. Linear Programming Formulation of Matrix Games.- 3. The Von Neumann Minimax Theorem.- 4. The Example Revisited.- 5. Two More Examples.- 6. Concluding Remarks.- Exercises.- 6 Transportation and Assignment Problems.- 0. Introduction.- 1. An Example The Balanced Transportation Problem.- 2. The Vogel Advanced-Start Method (VAM).- 3. The Transportation Algorithm.- 4. Another Example.- 5. Unbalanced Transportation Problems.- 6. The Assignment Problem.- 7. Concluding Remarks.- Exercises.- 7 Network-Flow Problems.- 0. Introduction.- 1. Graph-Theoretic Preliminaries.- 2. The Maximal-Flow Network Problem.- 3. The Max-Flow Min-Cut Theorem The Maximal-Flow Algorithm.- 4. The Shortest-Path Network Problem.- 5. The Minimal-Cost-Flow Network Problem.- 6. Transportation and Assignment Problems Revisited.- 7. Concluding Remarks.- Exercises.- APPENDIX A Matrix Algebra.- APPENDIX B Probability.- Answers to Selected Exercises.
Article
This paper presents a class of facet-defining inequalities for an assignment problem with the additional constraints that specified variables are required to be equal to each other. In a special case, the complete polyhedral description is given.
Article
Many resource-constrained assignment scheduling problems can be modeled as 0-1 assignment problems with side constraints APSC. Unlike the well-known assignment problem of linear programming, APSC is NP-complete. In this paper we define a branch-and-bound algorithm for solving APSC to optimality. The algorithm employs a depth-first, polychotomous branching strategy in conjunction with a bounding procedure that utilizes subgradient optimization. We also define a heuristic procedure for obtaining approximate solutions to APSC. The heuristic uses subgradient optimization to guide the search for a good solution as well as to provide a bound on solution quality. We present computational experience with both procedures, applied to over 400 test problems. The algorithm is demonstrated to be effective across three different classes of resource-constrained assignment scheduling problems. The heuristic generates solutions for these problems that are, on average, within 0.8% of optimality.
Article
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 flow or through specific algorithms. We consider the algorithm recently proposed by Dell'Amico and Martello for the case where W is dense, and derive, for the case of sparse matrices, an efficient algorithm which includes original heuristic preprocessing techniques. The resulting code is experimentally compared with min-cost flow codes from the literature. Extensive computational tests show that the code is considerably faster, and effectively solves very large sparse and dense instances.
Article
We consider a generalization of the assignment problem in which an integer k is given and one wants to assign k rows to k columns so that the sum of the corresponding costs is a minimum. The problem can be seen as a 2-matroid intersection, hence is solvable in polynomial time; immediate algorithms for it can be obtained from transformation to min-cost flow or from classical shortest augmenting path techniques. We introduce original preprocessing techniques for finding optimal solutions in which g⩽k rows are assigned, for determining rows and columns which must be assigned in an optimal solution and for reducing the cost matrix. A specialized primal algorithm is finally presented. The average computational efficiency of the different approaches is evaluated through computational experiments.
Article
This paper addresses the problem of finding a minimal weight assignment subject to a knapsack-type contraint. It develops a two-stage algorithm based on the Lagrangean-relaxation formulation of this problem. The first stage obtains the optimal Lagrange multiplier in a polynominal effort by generating the efficient frontier in a bicriteria framework. The second stage uses this information very effectively to zero in on the optimal solution in a relatively lower depth of search in the ordered-generation-of-assignments framework. The algorithm is supported by a numerical example and its advantages over other schemes are shown.
Article
Satellite communications, like batches of work in a job shop, need to be scheduled in order to use their resources as efficiently as possible. The most common satellite communications system in use today is known as Time Division Multiple Access (TDMA), in which data from earth stations is buffered before being transmitted to the appropriate receiver on a satellite. Cycles of transmission are fixed for all stations. Since the same satellite will be used for routeing data in several different ways, a schedule must be devised to use the receivers, repeaters and transmitters on board to minimize the time needed for completion of a batch of work. This paper is a survey of current scheduling algorithms used for optimizing satellite communications resources. Apart from telecommunications, the methods presented here could be applied to more general scheduling problems with renewable resources but without precedence constraints.