Search results
Results From The WOW.Com Content Network
Lambert's problem. In celestial mechanics, Lambert's problem is concerned with the determination of an orbit from two position vectors and the time of flight, posed in the 18th century by Johann Heinrich Lambert and formally solved with mathematical proof by Joseph-Louis Lagrange. It has important applications in the areas of rendezvous ...
In graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph.A path is called simple if it does not have any repeated vertices; the length of a path may either be measured by its number of edges, or (in weighted graphs) by the sum of the weights of its edges.
A minimum spanning tree of a weighted planar graph.Finding a minimum spanning tree is a common problem involving combinatorial optimization. Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, [1] where the set of feasible solutions is discrete or can be reduced to a discrete set.
Quadratically constrained quadratic program. In mathematical optimization, a quadratically constrained quadratic program ( QCQP) is an optimization problem in which both the objective function and the constraints are quadratic functions. It has the form. where P0, ..., Pm are n -by- n matrices and x ∈ Rn is the optimization variable.
Art gallery problem. The art gallery problem or museum problem is a well-studied visibility problem in computational geometry. It originates from the following real-world problem: "In an art gallery, what is the minimum number of guards who together can observe the whole gallery?" In the geometric version of the problem, the layout of the art ...
Subgraph isomorphism problem. In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one must determine whether G contains a subgraph that is isomorphic to H . Subgraph isomorphism is a generalization of both the maximum clique problem and the problem of ...
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs ...
PARI/GP is a computer algebra system that facilitates number-theory computation. Besides support of factoring, algebraic number theory, and analysis of elliptic curves, it works with mathematical objects like matrices, polynomials, power series, algebraic numbers, and transcendental functions. [3]