Dijkstra's algorithmDijkstra's algorithm (ˈdaɪkstrəz ) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants. Dijkstra's original algorithm found the shortest path between two given nodes, but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree.
Travelling salesman problemThe travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research. The travelling purchaser problem and the vehicle routing problem are both generalizations of TSP.
Evolutionary computationIn computer science, evolutionary computation is a family of algorithms for global optimization inspired by biological evolution, and the subfield of artificial intelligence and soft computing studying these algorithms. In technical terms, they are a family of population-based trial and error problem solvers with a metaheuristic or stochastic optimization character. In evolutionary computation, an initial set of candidate solutions is generated and iteratively updated.
Optimal controlOptimal control theory is a branch of mathematical optimization that deals with finding a control for a dynamical system over a period of time such that an objective function is optimized. It has numerous applications in science, engineering and operations research. For example, the dynamical system might be a spacecraft with controls corresponding to rocket thrusters, and the objective might be to reach the moon with minimum fuel expenditure.
Knapsack problemThe knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items to include in the collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
Sub-orbital spaceflightA sub-orbital spaceflight is a spaceflight in which the spacecraft reaches outer space, but its trajectory intersects the surface of the gravitating body from which it was launched. Hence, it will not complete one orbital revolution, will not become an artificial satellite nor will it reach escape velocity. For example, the path of an object launched from Earth that reaches the Kármán line (about – above sea level), and then falls back to Earth, is considered a sub-orbital spaceflight.
Rearrangement reactionIn organic chemistry, a rearrangement reaction is a broad class of organic reactions where the carbon skeleton of a molecule is rearranged to give a structural isomer of the original molecule. Often a substituent moves from one atom to another atom in the same molecule, hence these reactions are usually intramolecular. In the example below, the substituent R moves from carbon atom 1 to carbon atom 2: Intermolecular rearrangements also take place.
Pontryagin's maximum principlePontryagin's maximum principle is used in optimal control theory to find the best possible control for taking a dynamical system from one state to another, especially in the presence of constraints for the state or input controls. It states that it is necessary for any optimal control along with the optimal state trajectory to solve the so-called Hamiltonian system, which is a two-point boundary value problem, plus a maximum condition of the control Hamiltonian.
Dynamical systems theoryDynamical systems theory is an area of mathematics used to describe the behavior of complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle.
Claisen rearrangementThe Claisen rearrangement is a powerful carbon–carbon bond-forming chemical reaction discovered by Rainer Ludwig Claisen. The heating of an allyl vinyl ether will initiate a [3,3]-sigmatropic rearrangement to give a γ,δ-unsaturated carbonyl, driven by exergonically favored carbonyl CO bond formation (ΔΔHf = -327 kcal·mol−1). The Claisen rearrangement is an exothermic, concerted (bond cleavage and recombination) pericyclic reaction. Woodward–Hoffmann rules show a suprafacial, stereospecific reaction pathway.
