Search Results for ""

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

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 ...

An interior point method is a linear or nonlinear programming method (Forsgren et al. 2002) that achieves optimization by going through the middle of the solid defined by the ...

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

For a given m, determine a complete list of fundamental binary quadratic form discriminants -d such that the class number is given by h(-d)=m. Heegner (1952) gave a solution ...

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

The method for solving the Goursat problem and Cauchy problem for linear hyperbolic partial differential equations using a Riemann function.

The theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...

A perfect cuboid is a cuboid having integer side lengths, integer face diagonals d_(ab) = sqrt(a^2+b^2) (1) d_(ac) = sqrt(a^2+c^2) (2) d_(bc) = sqrt(b^2+c^2), (3) and an ...

The number of degrees of freedom in a problem, distribution, etc., is the number of parameters which may be independently varied.