Search Results for ""
311 - 320 of 1538 for traveling salesman problemSearch Results

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...
The series for the inverse tangent, tan^(-1)x=x-1/3x^3+1/5x^5+.... Plugging in x=1 gives Gregory's formula 1/4pi=1-1/3+1/5-1/7+1/9-.... This series is intimately connected ...
The longest increasing scattered subsequence is the longest subsequence of increasing terms, where intervening nonincreasing terms may be dropped. Finding the largest ...
The rook numbers r_k^((m,n)) of an m×n board are the number of subsets of size k such that no two elements have the same first or second coordinate. In other word, it is the ...
A graph H is called a topological minor, also known as a homeomorphic subgraph, of a graph G if a graph subdivision of H is isomorphic to a subgraph of G. Every topological ...
A uniform-density polyhedral solid is unistable (also called monostable) if it is stable on exactly one face (Croft et al. 1991, p. 61). For example, the 19-faced polyhedron ...
Whirls are figures constructed by nesting a sequence of polygons (each having the same number of sides), each slightly smaller and rotated relative to the previous one. The ...
The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...
A generalization of Poncelet's continuity principle made by H. Schubert in 1874-1879. The conservation of number principle asserts that the number of solutions of any ...
A standard form of the linear programming problem of maximizing a linear function over a convex polyhedron is to maximize c·x subject to mx<=b and x>=0, where m is a given ...

...