• fminsearch

  • Referenced in 258 articles [sw07467]
  • Convergence properties of the Nelder--Mead simplex method in low dimensions The Nelder--Mead simplex...
  • DistMesh

  • Referenced in 269 articles [sw12766]
  • scientific computing and computer graphics. An unstructured simplex mesh requires a choice of meshpoints (vertex...
  • GLPK

  • Referenced in 169 articles [sw04560]
  • following main components: primal and dual simplex methods, primal-dual interior-point method, branch...
  • OSL

  • Referenced in 106 articles [sw09295]
  • quite different computational kernels than the traditional simplex method. In particular, the matrices we must ... considerably denser than those assumed in simplex implementations. Severe rank deficiency must also be accommodated...
  • SoPlex

  • Referenced in 89 articles [sw04063]
  • Programming (LP) solver based on the revised simplex algorithm. It features preprocessing techniques, exploits sparsity ... Wunderling’s Ph.D. thesis Paralleler und Objektorientierter Simplex-Algorithmus (in German) and is available...
  • DEVEX

  • Referenced in 100 articles [sw08378]
  • time and iteration advantages over the standard simplex methods used today. The final illustration highlights...
  • testmatrix

  • Referenced in 79 articles [sw14347]
  • multidirectional search method and the Nelder--Mead simplex method...
  • LPbook

  • Referenced in 49 articles [sw31782]
  • major algorithms studied: -- The two-phase simplex method; -- The primal-dual simplex method; -- The path ... various pivot rules and variants of the simplex method, both for linear programming...
  • lp_solve

  • Referenced in 75 articles [sw04006]
  • integer) programming solver based on the revised simplex method and the Branch-and-bound method...
  • subplex

  • Referenced in 25 articles [sw04818]
  • SUBPLEX is a subspace-searching simplex method for the unconstrained optimization of general multivariate functions ... Like the Nelder-Mead simplex method it generalizes, the subplex method is well suited ... method is much more efficient than the simplex method. It can be used like...
  • MarPlex

  • Referenced in 25 articles [sw06750]
  • simplex algorithm initializing This paper discusses the importance of a starting point in the simplex ... number of iterations required by the simplex algorithm to find the optimal solution...
  • SG

  • Referenced in 35 articles [sw20599]
  • unstructured simplex mesh OpenGL display and manipulation tool for use with the finite element research...
  • OPERA

  • Referenced in 30 articles [sw03200]
  • least five times faster than the simplex LP solver in the Optimization Toolbox...
  • Gudhi

  • Referenced in 21 articles [sw08777]
  • Specifically, simplicial complexes are implemented with a simplex tree data structure. The simplex tree...
  • MCF

  • Referenced in 27 articles [sw05167]
  • network simplex implementation: Vehicle scheduling in public transit and Lagrangean pricing This paper investigates...
  • LEBFEK

  • Referenced in 15 articles [sw32027]
  • Vianello, Computing Fekete and Lebesgue points: simplex, square, disk we have described some algorithms ... quasi-)Fekete points on the unit simplex, a square and on the unit disk ... found in the links below. SIMPLEX; SQUARE; DISK...
  • simpcomp

  • Referenced in 24 articles [sw06898]
  • functions to compute new complexes from old (simplex links and stars, connected sums, cartesian products...
  • WinGULF

  • Referenced in 14 articles [sw19224]
  • assist students to understand principals of simplex method and branch-and-bound algorithm in linear ... manually an LP or LFP problem using simplex method, the package may be used ... implements) the special extended version of primal simplex method developed by B.Martos[1] with various...
  • compositions

  • Referenced in 22 articles [sw00150]
  • transformations and operations between compositions in the simplex...
  • ISUD

  • Referenced in 12 articles [sw34491]
  • ISUD: Integral simplex using decomposition for the set partitioning problem. Since the 1970s, several authors ... partitioning polytope and proposed adaptations of the simplex algorithm that find an optimal solution ... paper uses ideas from the improved primal simplex to deal efficiently with degeneracy and find ... algorithm referred to as the integral simplex using decomposition algorithm uses a subproblem to find...