Results 1  10
of
136,763
The Optimal Assignment Problem for a Countable State Space
, 2008
"... Given a n × n matrix B = (bij) with real entries, the optimal assignment problem is to find a permutation σ of {1,..., n} maximising the sum Pn i=1 biσ(i). In discrete optimal control and in the theory of discrete event systems, one often encounters the problem of solving the equation Bf = g for a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Given a n × n matrix B = (bij) with real entries, the optimal assignment problem is to find a permutation σ of {1,..., n} maximising the sum Pn i=1 biσ(i). In discrete optimal control and in the theory of discrete event systems, one often encounters the problem of solving the equation Bf = g
Perturbation of eigenvalues of matrix pencils and optimal assignment problem
 C. R. Acad. Sci. Paris, Série I
"... Abstract. We consider a matrix pencil whose coefficients depend on a positive parameter ǫ, and have asymptotic equivalents of the form aǫ A when ǫ goes to zero, where the leading coefficient a is complex, and the leading exponent A is real. We show that the asymptotic equivalent of every eigenvalue ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
, constructed from certain optimal assignment problems. Perturbation de valeurs propres de faisceaux matriciels et problème d’affectation optimale Résumé. Nous considérons un faisceau matriciel dont les coefficients, dépendant d’un paramètre ǫ, ont des équivalents asymptotiques de la forme aǫ A, lorsque ǫ tend
ALGORITHMS FOR THE ASSIGNMENT AND TRANSPORTATION PROBLEMS
, 1957
"... In this paper we presen algorithms for the solution of the general assignment and transportation problems. In Section 1, a statement of the algorithm for the assignment problem appears, along with a proof for the correctness of the algorithm. The remarks which constitute the proof are incorporated p ..."
Abstract

Cited by 454 (0 self)
 Add to MetaCart
omitted. 1. THE ASSIGNMENT PROBLEM. The personnelassignment problem is the problem of choosing an optimal assignment of n men to n jobs, assuming that numerical ratings are given for each man’s performance on each job. An optimal assignment is one which makes the sum of the men’s ratings
The Hungarian method for the assignment problem
 Naval Res. Logist. Quart
, 1955
"... Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent in the work ..."
Abstract

Cited by 1259 (0 self)
 Add to MetaCart
Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent
Shape Matching and Object Recognition Using Shape Contexts
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by (1) solv ing for correspondences between points on the two shapes, (2) using the correspondences to estimate an aligning transform ..."
Abstract

Cited by 1809 (21 self)
 Add to MetaCart
similar shapes will have similar shape con texts, enabling us to solve for correspondences as an optimal assignment problem. Given the point correspondences, we estimate the transformation that best aligns the two shapes; reg ularized thin plate splines provide a flexible class of transformation maps
Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization
, 1993
"... The paper describes a rankbased fitness assignment method for Multiple Objective Genetic Algorithms (MOGAs). Conventional niche formation methods are extended to this class of multimodal problems and theory for setting the niche size is presented. The fitness assignment method is then modified to a ..."
Abstract

Cited by 633 (15 self)
 Add to MetaCart
The paper describes a rankbased fitness assignment method for Multiple Objective Genetic Algorithms (MOGAs). Conventional niche formation methods are extended to this class of multimodal problems and theory for setting the niche size is presented. The fitness assignment method is then modified
Global Optimization with Polynomials and the Problem of Moments
 SIAM JOURNAL ON OPTIMIZATION
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear ma ..."
Abstract

Cited by 577 (48 self)
 Add to MetaCart
matrix inequality (LMI) problems. A notion of KarushKuhnTucker polynomials is introduced in a global optimality condition. Some illustrative examples are provided.
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
in the problem graph: ( 1) O(n log n + m) for the singlesource shortest path problem with nonnegative edge lengths, improved from O(m logfmh+2)n); (2) O(n*log n + nm) for the allpairs shortest path problem, improved from O(nm lo&,,,+2,n); (3) O(n*logn + nm) for the assignment problem (weighted bipartite
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 1003 (8 self)
 Add to MetaCart
assignment form and the control dependence graph have been proposed to represent data flow and control flow propertiee of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimization. Although both of these structures are attractive
Results 1  10
of
136,763