• symrcm

  • Referenced in 380 articles [sw08566]
  • McKee ordering of S. This is a permutation r such that S(r,r) tends ... matrices that come from long, skinny problems. The ordering works for both symmetric and nonsymmetric...
  • coin

  • Referenced in 18 articles [sw08381]
  • Permutation Test Framework. Conditional inference procedures for the general independence problem including two-sample...
  • NILS

  • Referenced in 7 articles [sw20669]
  • from the search space. Many combinatorial optimization problems share this property, that is generally very ... proposed and experimented on a permutation flowshop scheduling problem with the aim of minimizing...
  • perm_mateda

  • Referenced in 1 article [sw27196]
  • Algorithms for Permutation-based Combinatorial Optimization Problems. Permutation problems are combinatorial optimization problems whose solutions ... shown outstanding performance when solving some permutation problems. These novel EDAs implement distance-based exponential ... estimation of distribution algorithms on permutation problems, which has been implemented as an extension ... Ulam distances. In addition, four classical permutation problems have also been implemented: Traveling Salesman Problem...
  • BioGAP

  • Referenced in 4 articles [sw08793]
  • correspondence is established between genomes and permutations, the problem of determining the evolutionary distance between...
  • TRINICON

  • Referenced in 2 articles [sw08750]
  • rigorous broadband derivation avoiding the internal permutation problem and circularity effects...
  • PGDoubling

  • Referenced in 3 articles [sw21155]
  • algebraic Riccati equations and optimal control problems using permuted graph bases...
  • HyFlex

  • Referenced in 11 articles [sw07688]
  • hard combinatorial problems are fully implemented: maximum satisfiability, one dimensional bin packing, permutation flow shop ... extensive set of state-of-the-art problem specific heuristics and search operators. HyFlex represents...
  • pertsaus2

  • Referenced in 17 articles [sw15442]
  • permutation-translation simulated annealing algorithm for L 1 and L 2 unidimensional scaling. Given ... dissimilarities between them, Unidimensional Scaling is the problem of finding a representation by locating points ... line constitutes a serious computational problem. This paper presents an algorithm that implements Simulated Annealing ... weighted alternating process that uses permutations and point-wise translations to locate the optimal configuration...
  • PERMORY

  • Referenced in 1 article [sw35193]
  • findings requires statistical correction for multiple testing. Permutation tests are considered the gold standard ... years, the computational problem has been circumvented by using approximations to permutation tests, which, however ... have tackled the original computational problem of permutation testing in GWAS and herein present...
  • NFFr

  • Referenced in 3 articles [sw31999]
  • reversible circuit synthesis problem can be reduced to permutation group. This allows Schreier–Sims algorithm...
  • FourTiTwo

  • Referenced in 8 articles [sw07615]
  • Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals This paper ... closed with a number of interesting open problems...
  • gaoptim

  • Referenced in 1 article [sw11612]
  • Algorithm optimization for real-based and permutation-based problems. Performs a Genetic Algorithm Optimization, given...
  • COLAMD

  • Referenced in 28 articles [sw00145]
  • sparse Cholesky factorization, which requires a symmetric permutation of both the rows and columns ... those that arise in least-squares problems and interior point methods for linear programming problems...
  • KLU

  • Referenced in 15 articles [sw06365]
  • Direct Sparse Solver for Circuit Simulation Problems. KLU is a software package for solving sparse ... circuit simulation applications. It relies on a permutation to Block Triangular Form (BTF), several methods...
  • PERMGEN

  • Referenced in 1 article [sw18144]
  • Nawaz, Enscore, and Ham for the permutation flowshop problem (PFSP). The goal of the experimental...
  • NFT

  • Referenced in 2 articles [sw32000]
  • reversible circuit synthesis problem can be reduced to permutation group. This allows Schreier-Sims Algorithm...
  • ATENSOR

  • Referenced in 10 articles [sw00055]
  • symmetry relations and renaming dummy indices. This problem is important for the calculations ... Solution method: The group algebra technique for permutation group is applied to construct a canonical...
  • LINK

  • Referenced in 2 articles [sw02358]
  • with proof search and its problems about non-permutability and resource management. In the context...
  • SuiteSparseQR

  • Referenced in 29 articles [sw07348]
  • ordering phase pre-eliminates singletons by permuting the input matrix A into the form ... fill-reducing ordering. For sufficiently large problems, the resulting sparse QR factorization obtains a substantial...