Search Results for ""

The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...

Integer programming in a special case of linear programming in which all variables are required to take on integer values only. Set covering deployment is an example ...

Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...

The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...

A circle packing is an arrangement of circles inside a given boundary such that no two overlap and some (or all) of them are mutually tangent. The generalization to spheres ...

A perspective collineation with center O and axis o not incident is called a geometric homology. A geometric homology is said to be harmonic if the points A and A^' on a line ...

The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...

A rotation combined with an expansion or geometric contraction.

A transformation of the plane which transforms collinear points into collinear points. A projective collineation transforms every one-dimensional form projectively, and a ...