Search Results for ""
361 - 370 of 1538 for traveling salesman problemSearch Results

A "curve" (i.e., a continuous map of a one-dimensional interval) into a two-dimensional area (a plane-filling function) or a three-dimensional volume.
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 ...
How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...
A bicentric quadrilateral, also called a cyclic-inscriptable quadrilateral, is a four-sided bicentric polygon. The inradius r, circumradius R, and offset x are connected by ...
Conway's soldiers, also known as the "solitaire army" game (Berlekamp et al. 1982) or "checker-jumping problem" (Honsberger 1976) is a one-player game played on an infinite ...
A Kirkman triple system of order v=6n+3 is a Steiner triple system with parallelism (Ball and Coxeter 1987), i.e., one with the following additional stipulation: the set of ...
A pseudoperfect number, sometimes also called a semiperfect number (Benkoski 1972, Butske et al. 1999), is a positive integer such as 20=1+4+5+10 which is the sum of some (or ...
There are a number of functions in various branches of mathematics known as Riemann functions. Examples include the Riemann P-series, Riemann-Siegel functions, Riemann theta ...
The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...
The Parts graphs are a set of unit-distance graphs with chromatic number five derived by Jaan Parts in 2019-2020 (Parts 2020a). They provide some of the smallest known ...

...