The following pages link to Algorithm 548 (Q27990):
Displayed 14 items.
- Block clustering with collapsed latent block models (Q746220) (← links)
- Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem (Q884452) (← links)
- Improving the Hungarian assignment algorithm (Q1085073) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- Primal-dual algorithms for the assignment problem (Q1095790) (← links)
- Algorithm for the solution of the bottleneck assignment problem (Q1148790) (← links)
- Scaling and structural condition numbers (Q1368765) (← links)
- Improved model-based clustering performance using Bayesian initialization averaging (Q1729337) (← links)
- Algorithm for the solution of the assignment problem for sparse matrices (Q1838425) (← links)
- A new pivoting strategy for Gaussian elimination (Q1915612) (← links)
- Bayesian variable selection for latent class analysis using a collapsed Gibbs sampler (Q2631382) (← links)
- Periodic Metro Scheduling (Q2917403) (← links)
- Analysis of a Splitting Approach for the Parallel Solution of Linear Systems on GPU Cards (Q5268983) (← links)
- A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements (Q5944024) (← links)