scientific article; zbMATH DE number 3231693
From MaRDI portal
Publication:5519711
zbMath0143.42001MaRDI QIDQ5519711
Publication date: 1956
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (37)
Distribution-Free Consistent Independence Tests via Center-Outward Ranks and Signs ⋮ Scaling algorithms for network problems ⋮ Distribution-free testing in linear and parametric regression ⋮ Euclidean maximum matchings in the plane -- local to global ⋮ The assignment problem revisited ⋮ Primal-dual algorithms for the assignment problem ⋮ Linear-Time Approximation for Maximum Weight Matching ⋮ Computing the sequence of \(k\)-cardinality assignments ⋮ The \(\beta\)-assignment problem in general graphs ⋮ Time-cost tradeoff in a three-dimensional assignment problem ⋮ Error-free and best-fit extensions of partially defined Boolean functions ⋮ Graphical representation and hierarchical decomposition mechanism for vertex-cover solution space ⋮ Representation learning for clustering via building consensus ⋮ Multi-league sports scheduling with different leagues sizes ⋮ Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond ⋮ Unnamed Item ⋮ Ganzzahlige Programmierungen. Theorie und Anwendungen in der Praxis ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ A labeling algorithm for the fuzzy assignment problem. ⋮ The complexity of computing metric distances between partitions ⋮ The \(k\)-coloring fitness landscape ⋮ Critical objective function values in linear sum assignment problems ⋮ On a class of assignment problems. ⋮ On complexity of special maximum matchings constructing ⋮ Location of facility based on simulated annealing and ``ZKW algorithms ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ Graph editing problems with extended regularity constraints ⋮ An algorithm for ranking assignments using reoptimization ⋮ Fast algorithms for placing large entries along the diagonal of a sparse matrix ⋮ Unnamed Item ⋮ On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching ⋮ Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes ⋮ Some aspects on solving transportation problem ⋮ A priority based unbalanced time minimization assignment problem ⋮ Bestimmung eines maximalen Matching in beliebigen Graphen ⋮ The \(\beta\)-assignment problems ⋮ A variant of time minimizing assignment problem
This page was built for publication:
