The UvA-LINKER will give you a range of other options to find the full text of a publication (including a direct link to the full-text if it is located on another database on the internet).
De UvA-LINKER biedt mogelijkheden om een publicatie elders te vinden (inclusief een directe link naar de publicatie online als deze beschikbaar is in een database op het internet).


Zoekopdracht: faculteit: "FEB" en publicatiejaar: "2004"

AuteurA. Volgenant
TitelSolving the k-cardinality assignment problem by transformation
TijdschriftEuropean Journal of Operational Research
FaculteitFaculteit Economie en Bedrijfskunde
Instituut/afd.FEB: Amsterdam School of Economics Research Institute (ASE-RI)
SamenvattingThe k-cardinality Linear Assignment Problem (k-LAP) with k a given integer is a generalization of the linear assignment problem: one wants to assign k rows (a free choice out of more rows) to k columns (a free choice out of more columns) minimizing the sum of the corresponding costs. For this polynomially solvable problem special algorithms are known based on transformation to min-cost flow or on shortest augmenting paths. We describe a transformation that enables to solve the k-LAP by any standard linear assignment algorithm. The transformation can be modified to solve the group assignment problem as a standard problem. Computational results for random test instances up to size n=500 with various k-values and randomly drawn cost coefficients show that the transformation approach is suited to solve the k-LAP within short computer times on a standard personal computer.
Soort documentArtikel
Document finderUvA-Linker