References in zbMATH (referenced in 14 articles )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. O’Hagan, Adrian; White, Arthur: Improved model-based clustering performance using Bayesian initialization averaging (2019)
  2. Li, Ang; Serban, Radu; Negrut, Dan: Analysis of a splitting approach for the parallel solution of linear systems on GPU cards (2017)
  3. White, Arthur; Wyse, Jason; Murphy, Thomas Brendan: Bayesian variable selection for latent class analysis using a collapsed Gibbs sampler (2016)
  4. Wyse, Jason; Friel, Nial: Block clustering with collapsed latent block models (2012)
  5. Talbi, El-Ghazali; Weinberg, Benjamin: Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem (2007)
  6. Bampas, Evangelos; Kaouri, Georgia; Lampis, Michael; Pagourtzis, Aris: Periodic metro scheduling (2006)
  7. Chen, Liang; Tokuda, Naoyuki: A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements (2001)
  8. Neumaier, Arnold: Scaling and structural condition numbers (1997)
  9. Olschowska, Markus; Neumaier, Arnold: A new pivoting strategy for Gaussian elimination (1996)
  10. Carpaneto, Giorgio; Toth, Paolo: Primal-dual algorithms for the assignment problem (1987)
  11. Jonker, R.; Volgenant, A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems (1987)
  12. Jonker, Roy; Volgenant, Ton: Improving the Hungarian assignment algorithm (1986)
  13. Carpaneto, G.; Toth, P.: Algorithm for the solution of the assignment problem for sparse matrices (1983)
  14. Carpaneto, G.; Toth, P.: Algorithm for the solution of the bottleneck assignment problem (1981)