Algorithm 548
From MaRDI portal
Cited in
(15)- Improving the Hungarian assignment algorithm
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Primal-dual algorithms for the assignment problem
- Algorithm for the solution of the bottleneck assignment problem
- Scaling and structural condition numbers
- Improved model-based clustering performance using Bayesian initialization averaging
- Algorithm for the solution of the assignment problem for sparse matrices
- A new pivoting strategy for Gaussian elimination
- Bayesian variable selection for latent class analysis using a collapsed Gibbs sampler
- Periodic metro scheduling
- SaPGPU
- Analysis of a splitting approach for the parallel solution of linear systems on GPU cards
- A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements
- Block clustering with collapsed latent block models
- Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem
This page was built for software: Algorithm 548
